Given a Turing Machine $$M = (\{q_0, q_1\}, \{0, 1\}, \{0, 1, B\}, δ, B, \{q_1\})$$ Where $δ$ is a transition function defined as $$δ (q_0, 0) = (q_0, 0, R)$$ $$δ (q_0, B) = (q_1, B, R)$$ The language $L(M)$ accepted by Turing machine is given as :
- $0^*1^* $
- $ 00^*$
- $10^* $
- $1^*0^*$
My attempt:
We, can draw DFA for given transition function of Turing Machine, and expression should be as $0^*$, but official key is given option $(2)\space 00^*$.
Can you explain it, please?
$00^∗$ is subset of $0^∗$, so, this TM can also accept the all string of $00^∗$. However other than $00^∗$ only $ϵ$ is also accepted by given TM.