1. Consider the following Turing machine:
M = ( {q0, q1, q2, qacc, qrej}, {0, 1}, {0, 1,B}, δ, q0 , qacc,qrej)
Describe the language L(M) if δ consists of the following sets ofrules (if an entry δ(q, a) is
missing, by default it means that the Turing machine enters qrej).No justification is needed.
a)
δ(q0, 0) = (q1, 1,R);
δ(q1, 1) = (q0, 0,R);
δ(q1,B) = (qacc,B,R).
b)
δ(q0, 0) = (q1, 1,R);
δ(q1, 1) = (q2, 0,L);
δ(q2, 1) = (q0, 1,R);
δ(q1,B) = (qacc,B,R).
Expert Answer
An answer will be send to you shortly. . . . .