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 of rules (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).