Single Tape Turing Machine Simulator
- First line should contain the number of the start state.
- Second line should contain the numbers of end states separated by
,
. - Starting from the third line the transitions are listed and separated by a newline.
- The transition should be in the form
x,i>y,o,D
x
is the source state.i
is the input character.y
is the target state.o
is the output character.D
is the direction which should be{ R | L | S }
- The transition should be in the form
- In the Examples folder there are text files containing valid turing machines examples.