Question

Problem 5: [20 Points] [Turing Machines] Consider the single tape deterministic Turing machine with input alphabet E = {#, a} and tape alphabet T = {0, 1, #} whose transition diagram is given in Figure 5 below. As always, we assume that the accepting state qF has no outgoing transitions and any transitions from symbols not shown in the states (other than qF) go to the reject state qrej, which is not shown in the picture. a1, L ##, L ##, R aa, R ##, R aaR ##, L #, R a0, L Figure 1: Turing machine for Problem 5 l. Give the sequence of configurations of the Turing machine when it is run on the input #a#. [3 points] 2. Give the sequence of configurations of the Turing machine when it is run on the input #aa#. [4 points]

          Problem 5: [20 Points] [Turing Machines]
Consider the single tape deterministic Turing machine with input alphabet E = {#, a} and tape alphabet T = {0, 1, #} whose transition diagram is given in Figure 5 below. As always, we assume that the accepting state qF has no outgoing transitions and any transitions from symbols not shown in the states (other than qF) go to the reject state qrej, which is not shown in the picture.

a1, L
##, L
##, R
aa, R
##, R
aaR
##, L
#, R
a0, L

Figure 1: Turing machine for Problem 5

l. Give the sequence of configurations of the Turing machine when it is run on the input #a#. [3 points]
2. Give the sequence of configurations of the Turing machine when it is run on the input #aa#. [4 points]

problem 5 20 points turing machines consider the single tape deterministic turing machine with input alphabet e a and tape alphabet t 01 whose transition diagram is given in figure 5 below a 66144

Added by Brittany A.

Question

Please give Ace some feedback