Turing machine for Regular languages in theory of automata

Turing machine for Regular languages:

Regular languages can be represented through finite automata and similarly can be represented through Turing Machine.

This machine must accept all strings starting from a and ending with b. e.g, ab,aab, abab etc.

Let’s discuss the diagram;

[quads id=1]


Starts the machine


Read a from input tape and write a and move Right on input tape.

State 2: 

Read a from input tape and write a and move Right on input tape. There is a loop of a, a, R on state 2. 

If read b from input tape, then write b and move right and halts the machine by accepting the string.

If there is any a on accept state then again control moves to the state 2, enforcing the machine to not end with a.

Fazal Rehman Shamil Click Here to Know More
Instructor, Researcher, Blogger, SEO Expert, Poet and Publisher of International Journal Of Software, Technology & Science ISSN : 2616 - 5325
Dear Professors and Resarchers!You are welome to Cite these tutorials in your research or slides etc. Please don't forget to mention the reference of website. Copy Paste of text is strcitly forbidden. Images can be reuse because images are protected with watermark.

Leave a Reply

Your email address will not be published. Required fields are marked *