Turing Machine of equal a and b in theory of automata

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.

Logic:

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.

Accepted strings:

Such kind of strings should be accepted by Turing Machine.

e.g, ab, aabb, aaabbb,…..etc.

Rejected strings:

Such kind of strings should be rejected by Turing Machine.

e.g, abb, aab, aaabb,…..etc.

Turing machine in toc
Figure: Turing machine of all equal length strings
Fazal Rehman Shamil
Welcome to all friends. The reason for our success is only your love for T4Tutorials. Our team is always available to answer your queries regarding any kind of confusions or discussion regarding your study and career matters. For discussion with us please join our facebook group "T4Tutorials.com". The link of the group is mentioned below. Thanks and love to all for connecting with us. We are nothing without you. Love you all.....
https://web.facebook.com/groups/2066136233601097/

Leave a Reply