Question $3(1$ point$)$ Grafstate ${?}^{mw}$

Which of the following strings are accepted by this machine? Select all that apply.

$01110$

$0011$

$101001$

$11000011$ Question $4(1$ point$)$

What is the language of the Turing machine shown in Problem $3?$ Select all that

apply.

$\{w=u()u^R|uin{}^{*}{?}^{{?}^{?}}|w|>0\}$

$\{win{}^{*}|w=w^R{?}^{{?}^{?}}|w|>0\}$

$\{w{w}^R|win{}^{*}{?}^{{?}^{?}}|w|>0\}$

$\{win{}^{*}|wis$ a palindrome $\}$

$\{win{}^{*}|w=w^R\}$

Consider the following $2-$tape TM$.$ Each transition in this machine takes $2$ rows,

where the first row describe the transition on Tape $1$ and the second row describes

the transition on Tape $2.$ For example, there are $2$ possible transition from $q_0$ to $q_1.$

If Tape $1$ contains a $0,$ a $0$ is written on Tape $1,$ and an A is written on Tape $2,$

and both tape heads move right.

If Tape $1$ contains a $1,$ a $1$ is written on Tape $1,$ and a B is written on Tape $2,$

and both tape heads move right.

State diagram for a $2-$tape Turing machine

Which of the following strings are accepted by this machine? Select all that apply.