Hello,
I have been given the question :
to create a turing machine that begins on a tape containing a single 1 and never halts but successively displayes the strings.
..b 1 b...
..b 0 1 0 b...
..b 0 0 1 0 0 b...
where b stands for blank.
This is the states I came up with :
S0- starting state pointing to the single 1
S1- state scanning for the leftmost blank
S2 - state that prints out /displays the 0 or 1
S3 - state that does not print blanks.
The following are the tuples I came up with :
(S0,1,1,S1,L)
(S1,0,0,S1,L)
(S1,b,b,S2,R)
(S2,0,0,S2,R)
(S2,1,1,S2,R)
(S2,b,b,S3,R)
(S3,b,b,S3,R)
My question is - from S3, when i encounter a 0 or 1, what should I do?
Any help would be really appreciated.
Thank you,
