Text: Two problems, explain the choice reason, thanks.
2. For the above Turing machine M with the state diagram, what language does it decide over the alphabet {0, 1}?
A. { w | w contains an equal number of 0s and 1s}
B. { ww | w is any string over the alphabet }
C. { w#w | w is any string over the alphabet}
D. { w | w contains twice as many 0s as 1s}
For the following Turing machine M with the state diagram, the transition from state q5 to q6 says that when M reads a 1, write (mark an X) onto the tape, then move its reading/writing head one position to its left.
9i
*
0,1-R
92
98
R
93
0,1R
#R
#R
94
95
-R
qaccept
96
0,1,x-L
#L
x-R
97
0,1L
O True
O False