Turing Machine Simulator
Simulate and analyze the behavior of deterministic and non-deterministic Turing Machines. Define states, alphabet, transition rules, and observe the computation step by step.
Input Tape
Simulation
1
0
1
1
Current State: q0
Head Position: 0
500ms
Execution Trace
$ Starting simulation with input: 1011
Step 1: State q0, Read 1, Write 1, Move Right, Next State q1
Step 2: State q1, Read 0, Write 0, Move Right, Next State q1
Step 3: State q1, Read 1, Write 1, Move Right, Next State q2
Current: State q0, Head at position 0, Symbol 1