Turing Machine of equal a’s and b’s:
Suppose we want to design a Turing Machine for the language of anbn where a=b.
If machine reads anyone a from the input tape, then machine write X and if machine reads any b then machine write y;
a = X
b = Y
Purpose to make every a as X and to every b as Y is only to match one a with one b. This is the way to the bound equal number of a’s and b’s.
Such kind of strings should be accepted by Turing Machine.
e.g, ab, aabb, aaabbb,…..etc.
Such kind of strings should be rejected by Turing Machine.
e.g, abb, aab, aaabb,…..etc.