Consider the Turing Machine For the Following Tape, Determine the Final Tape When

Short Answer

Consider the Turing machine $T : \left( s _ { 0 } , 0 , s _ { 1 } , 1 , R \right) , \left( s _ { 0 } , 1 , s _ { 1 } , 1 , R \right) , \left( s _ { 1 } , 0 , s _ { 0 } , 1 , L \right) , \left( s _ { 1 } , 1 , s _ { 0 } , 0 , R \right) , \left( s _ { 0 } , B , s _ { 1 } , 1 , R \right)$ For the following tape, determine the final tape when $T$ halts, assuming that $T$ begins in state $s _ { 0 }$ at the leftmost nonblank symbol. $$\begin{array} { l | l | l | l | l | l | l | l | l } \hline \cdots & \mathrm { B } & \mathrm { B } & 0 & 0 & 0 & \mathrm {~B} & \mathrm {~B} & \cdots \\\hline\end{array}$$