COMS11700 TUTORIAL ON TURING MACHINE NOTATION
Consider a Turing machine T with
states Q = {a,b,c,d,e}
input alphabet = {0,1,2}
tape alphabet = {0,1,2,_} where “_” is the blank symbol
start state q0 = a
accept state qa = d
reject state qr = e
transition func. = the function defined by the following table (which gives the
current state, read symbol, next state, write symbol, L/R):
a,_,d,_,R
a,0,b,_,R
a,1,c,_,R
b,_,d,0,R
b,0,b,0,R
b,1,c,0,R
c,_,d,1,R
c,0,b,1,R
c,1,c,1,R
QUESTION 1: Complete the following graphical representation of
Note that, for simplicity, you may omit the reject state and any implicit transitions to it – as
these are assumed to “occur implicitly whenever a state lacks an outgoing transition for a
particular symbol” (Sipser p.147). In addition, you may use the notation “xR” or “xL”
as a shorthand for “xx,R” or “xx,L” (Sipser p.146).
