Mid-1 (10 points + 2 bonus points) Exercise 1 (4 pts). Let M be the following Turing machine:

0

1

q0

q1,0,R

q1,1,R

q1

q1,0,R

q1,1,R

q2

qa

qr

Input alphabet: Tape alphabet: Set of states:

= {0, 1}

= {0, 1, }

Q = {q0, q1, q2, qa, qr}

ontspoints) rcise 1 (4 pts). Let M be the following Turing machine: Input alphabet: Tape alphabet: Set of states: = {0, 1} = {0, l Q={go, q1-2, qa, 90,R, 1R L, Ir 91 91,0, Ir r each statement indicate whether it is true or false. 1. M accepts infinitely many strings, i.e. L(M) is infinite