Question

I'm not sure how to answer this problem. Can someone help me with this. thanks

5. Let M be the Turing machine BIBR 9 9 ala R a) Give a regular expression for L(M. b) Using the techniques from Theorem 10.1.3, give the rules of an unrestricted gram- mar G that accepts L(M. c) Trace the computation of M when run with input bab and give the corresponding derivation in G.

Answer 1

a) (ba)*b

b)
S -> baS | b

c)

q0 > bab
q1 > bab
b q2 > ab
ba q1 > b
bab q2 >

ended at final state
ACCEPTED