yorkhuman
- 1
- 0
Design a Turing machine for each of the following languages, give formal description of the TM and draw state diagram.
{ai bj ck |i + k = j, and i,j ≥ 0, k ≥ 1}.
Some example words of the language are asfollows:
a. aabccc
b. abbbbccccc
c. ac
d. bc
{ai bj ck |i + k = j, and i,j ≥ 0, k ≥ 1}.
Some example words of the language are asfollows:
a. aabccc
b. abbbbccccc
c. ac
d. bc