Turing

Turing

Trans. func:
A4:D20
Accept states:
F3:F10
Reject states:
G3:G10
Transition function
Accept states
Reject states
If (state, input) is
then enter state
write symbol
and go
7
6
1,0
5
0
R
1,x
6
x
R
1,a
2
0
R
2,0
7
0
R
2,x
2
x
R
2,a
3
x
R
3,0
5
0
L
3,x
3
x
R
3,a
4
a
R
4,0
6
0
R
4,x
4
x
R
4,a
3
x
R
5,0
2
0
R
5,x
5
x
L
5,a
5
a
L
Autofill rows from line 26 down to run the Turing machine.
If longer tape is needed, autofill columns.
Execution
State
Position
Input
New symbol
Accept?
Tape
1
1
a
0
a
a
a
a
2
2
a
x
0
a
a
a
0
0
3
3
a
a
0
x
a
a
0
0
4
4
a
x
0
x
a
a
0
0
3
5
0
0
0
x
a
x
0
0
5
4
x
x
0
x
a
x
0
0
5
3
a
a
0
x
a
x
0
0
5
2
x
x
0
x
a
x
0
0
5
1
0
0
0
x
a
x
0
0
2
2
x
x
0
x
a
x
0
0
2
3
a
x
0
x
a
x
0
0
3
4
x
x
0
x
x
x
0
0
3
5
0
0
0
x
x
x
0
0
5
4
x
x
0
x
x
x
0
0
5
3
x
x
0
x
x
x
0
0
5
2
x
x
0
x
x
x
0
0
5
1
0
0
0
x
x
x
0
0
2
2
x
x
0
x
x
x
0
0
2
3
x
x
0
x
x
x
0
0
2
4
x
x
0
x
x
x
0
0
2
5
0
0
0
x
x
x
0
0
7
6
0
#N/A
Accept
0
x
x
x
0
0