Given a Turing Machine
$M=(\{q_0, q_1, q_2, q_3\}, \{a,b\}, \{a, b, B\}, \delta, B, \{q_3\})$
where $\delta$ is a atransaction function defined as
$\delta(q_0,a)=(q_1, a, R)$
$\delta(q_1, b)=(q_2, b, R)$
$\delta(q_2, a)=(q_2, a, R)$
$\delta(q_2,b)=(q_3, b, R)$
The language L(M) accepted by the Turing machine is given as:
- aa*b
- abab
- aba*b
- aba*