Emulator

Turing machine

Configure the initial tape and transition table, then explore the machine step by step.

Workspace

not started

Initial tape without the _ symbol

Initial state

Tape the head is highlighted

State —

Head —

Steps 0

Result —

Transition table up to 1000 steps per run

Alphabet symbols separated by spaces

States ! means halt

In a cell, enter: new symbol, direction, new state. For example: 1, R, q1.

Execution log

Blank cell

The symbol _ in the alphabet denotes a blank space on the infinite tape.

a,R,q

Cell action

Write a symbol, move the head, and enter the specified state.

L/R

Head movement

L — left, R — right, S — stay in place.

■

Halting

Only entering the special state ! means the program completed successfully.

∅

Empty rule

If a cell is empty, the configuration does not change and the machine loops.

Ready-made example

Add one to a binary number: 1011 → 1100.