Answer
Constructing a Turing machine that recognizes the set
{0^n 1^n 2^n | n ≥ 0}.
Work Step by Step
a Turing machine that recognizes the set {0^n 1^n 2^n | n ≥ 0} is
(s0, B, s9, B, L),
(s0, 0, s1, 0, L),
(s1, B, s2, E, R),
(s2, M, s2, M, R),
(s2, 0, s3, M, R),
(s3, 0, s3, 0, R),
(s3, M, s3, M, R),
(s3, 1, s4, M, R),
(s4, 1, s4, 1, R),
(s4, M, s4, M, R),
(s4, 2, s5, M, R),
(s5, 2, s5, 2, R),
(s5, B, s6, B, L),
(s6, M, s8, M, L),
(s6, 2, s7, 2, L),
(s7, 0, s7, 0, L),
(s7, 1, s7, 1, L),
(s7, 2, s7, 2, L),
(s7, M, s7, M, L),
(s7, E, s2, E, R),
(s8, M, s8, M, L),
(s8,E, s9,E,L)
where M and E are markers, with E marking the left end of the input
