Given a Turing Machine M = ({q₀, q₁}, {0, 1}, {0, 1, B}, δ, B, {q₁})
Given a Turing Machine
M = ({q₀, q₁}, {0, 1}, {0, 1, B}, δ, B, {q₁})
Where δ is a transition function defined as
δ(q₀, 0) = (q₀, 0, R)
δ(q₀, B) = (q₁, B, R)
The language L(M) accepted by turing machine is given as:
Show answerHide answer
Correct answer: (B) 00*
Explanation
The machine moves right over 0s and accepts on reaching the blank, so it accepts 0*. 00* is a subset of 0*, so the machine accepts all strings of 00*; the only other accepted string is the empty string ε.