<CS> Learning

Turing Machine Simulator

Build a transition table, then step the machine along the tape

HEAD

State: S0

State Transitions

Select a state's name to rename it. Choose one start state and tick any halt states. Hover over i to read a rule in words.

Edit rule

Edit Alphabet

The blank symbol _ is always part of the alphabet. Add up to 16 other single-character symbols.

Removing a symbol deletes its rules and clears it from the tape. New symbols start with a rule that writes the same symbol, moves right and stays in the same state.

Clear all rules?

Are you sure? This deletes every state and transition rule and leaves a single start state, S0. The tape and alphabet are kept.