in the figure below?
6. What happens in Example 9.10 if the string w contains any symbol other than
1?
7. Construct Turing machines that will accept the following languages on {a,
b}.
(a) L = L(aba*b).
(b) L = {w : |w| is even}.
(c) L = {w : |w| is a multiple of 3}.
(d) L = {a n b m : n≥1, n ≠m}.
(e) L = {w: n a (w)= n b (w)}.
(f) L = {a n b m a n+m : n ≥ 0,m ≥1}.
(g) L = {a n b n a n b n : n ≥0}.
(h) L = {a n b 2n : n ≥ 1}.
For each problem, write out δ in complete detail, then check your answers
by tracing several test examples.
8. Design a Turing machine that accepts the language
6. What happens in Example 9.10 if the string w contains any symbol other than
1?
7. Construct Turing machines that will accept the following languages on {a,
b}.
(a) L = L(aba*b).
(b) L = {w : |w| is even}.
(c) L = {w : |w| is a multiple of 3}.
(d) L = {a n b m : n≥1, n ≠m}.
(e) L = {w: n a (w)= n b (w)}.
(f) L = {a n b m a n+m : n ≥ 0,m ≥1}.
(g) L = {a n b n a n b n : n ≥0}.
(h) L = {a n b 2n : n ≥ 1}.
For each problem, write out δ in complete detail, then check your answers
by tracing several test examples.
8. Design a Turing machine that accepts the language