For the following Turing machines T , ﬁnd the ﬁnal tape when T is run on the following tape, beginning in the initial position (the ﬁrst nonzero entry from the left): $$\begin{array}{l}
\begin{array} { l | l | l | l | l | l | l | l | l | l | l | l }
\hline \cdots & \mathrm { B } & \mathrm { B } & 0 & 0 & 0 & 1 & \mathrm {~B} & 0 & \mathrm {~B} & \mathrm {~B} & \cdots \
\hline
\end{array}\
\left( s _ { 0 } , 0 , s _ { 0 } , 0 , R \right) , \left( s _ { 0 } , 1 , s _ { 1 } , 0 , R \right) , \left( s _ { 1 } , 0 , s _ { 1 } , 1 , R \right) , \left( s _ { 1 } , 1 , s _ { 2 } , 1 , L \right) , \left( s _ { 1 } , B , s _ { 1 } , 1 , L \right)
\end{array}$$

Question

For the following Turing machines T , ﬁnd the ﬁnal tape when T is run on the following tape, beginning in the initial position (the ﬁrst nonzero entry from the left): $$\begin{array}{l}
\begin{array} { l | l | l | l | l | l | l | l | l | l | l | l } 
\hline \cdots & \mathrm { B } & \mathrm { B } & 0 & 0 & 0 & 1 & \mathrm {~B} & 0 & \mathrm {~B} & \mathrm {~B} & \cdots \
\hline
\end{array}\
\left( s _ { 0 } , 0 , s _ { 0 } , 0 , R \right) , \left( s _ { 0 } , 1 , s _ { 1 } , 0 , R \right) , \left( s _ { 1 } , 0 , s _ { 1 } , 1 , R \right) , \left( s _ { 1 } , 1 , s _ { 2 } , 1 , L \right) , \left( s _ { 1 } , B , s _ { 1 } , 1 , L \right)
\end{array}$$

Quizplus · Accepted Answer

The Answer of For the following Turing machines T , ﬁnd the ﬁnal tape when T is run on the following tape, beginning in the initial position (the ﬁrst nonzero entry from the left): $$\begin{array}{l}
\begin{array} { l | l | l | l | l | l | l | l | l | l | l | l } 
\hline \cdots & \mathrm { B } & \mathrm { B } & 0 & 0 & 0 & 1 & \mathrm {~B} & 0 & \mathrm {~B} & \mathrm {~B} & \cdots \
\hline
\end{array}\
\left( s _ { 0 } , 0 , s _ { 0 } , 0 , R \right) , \left( s _ { 0 } , 1 , s _ { 1 } , 0 , R \right) , \left( s _ { 1 } , 0 , s _ { 1 } , 1 , R \right) , \left( s _ { 1 } , 1 , s _ { 2 } , 1 , L \right) , \left( s _ { 1 } , B , s _ { 1 } , 1 , L \right)
\end{array}$$

For the Following Turing Machines T , ﬁNd the ﬁNal