Turing machine for the language of all those string in which a is less than b in Theory of automata

Last modified on May 26th, 2018 at 2:07 pm

Turing machine for the language of all those string in which a is less than b, ambn,  where a<b

Explanation of diagram:

Start:

Start of machine operation

From start, there is a,x,r

Read a, write X, move right

From state 2, read a, write a and move right or read Y, write Y, move right.

From state 2, Read B, Write Y, write Y and move right.

Halt state:

Halt state is the ending state.

ambn where a is not equal to b

Figure: Turing machine for a is less than b 

 

 

Prof. Fazal Rehman Shamil
Researcher, Publisher of International Journal Of Software Technology & Science ISSN: 2616-5325
Instructor, SEO Expert, Web Programmer and poet.
Feel free to contact.