Consider the TM with Q = q0, q1, q2, f, E= {0,1}, r= (0,1,b} (b for blank),
Fantastic news! We've Found the answer you've been seeking!
Question:
Consider the TM with Q = q0, q1, q2, f, E= {0,1}, r= (0,1,b} (b for blank), initial state q0 and final state f, with transition defined below:
(q0, 0) → (q1, 1, R);
(q1,1) → (q2, 0, L);
(q2, 1) → (q0,1,R);
(q1, b) → (f, b, R)
(a) Provide he execution trace of this machine on the input 011
(b) Describe the language accepted by the TM
(c) Suppose the transition (q 0 , 0) ? (q 1 , 1, R) is replaced by (q 0 , 0) ? {(q 1 , 1, R); (q 0 , 0, R)}. Describe the language accepted by the new TM (Note that this new machine is non-deterministic.)
Related Book For
Probability and Random Processes With Applications to Signal Processing and Communications
ISBN: 978-0123869814
2nd edition
Authors: Scott Miller, Donald Childers
Posted Date: