Question: Consider the Turing machine M, M=({q 0 , q 1 , q 2 , f}, {0, l},{ 0, l, B}, ,q 0 , B, {f}),

Consider the Turing machine M, M=({q0, q1, q2, f}, {0, l},{ 0, l, B}, ,q0, B, {f}), whose transitions are defined below. (q0 ,0) = { ( q1, 1, R) } (q1 ,1) = { (q2, 0, L) } (q2 ,1) = { (q0, 1, R) } (q1 ,B) = { (f ,B, R) } (a) Provide the execution trace of this machine on the input 011.

(b) Describe the language accepted by M.

(c) Suppose that the transition function defined above is modified so that the transition (q0 ,0) = { (q1, 1, R) } is replaced by the following. (q0 ,0) = { (q1, 1, R),(q0 , 0 ,R) } Describe the language accepted by M.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!