Turing Machine (TM) Simulation
TM Simulation provides information on whether the given string was accepted, rejected or looped and which states it visited. Also, after the program finishes running, it creates an OutputFile
1 (number of variables in input alphabet)
2 (number of variables in tape alphabet)
7 (number of states)
q1 q2 q3 q4 q5 qA qR (states)
q1 (start state)
qA (accept state)
qR (reject state)
b (blank symbol)
0 X b (the tape alphabet)
0 (the input alphabet)
q1 0 b R q2
q1 b b R qR
q1 X X R qR
q2 0 X R q3
q2 X X R q2
q2 b b R qA
q3 X X R q3
q3 0 0 R q4
q3 b b L q5
q4 X X R q4
q4 0 X R q3
q4 b b R qR
q5 0 0 L q5
q5 X X L q5
q5 b b R q2
00 (string to be detected)
000 (string to be detected)
q1 q2 q3 q5 q5 q2 q2 qA
Accepted
q1 q2 q3 q4 qR
Rejected