Build a Turing machine

Hopcroft 2e §8.2.2–8.2.4. Type δ the way the book tabulates it — one move per line — and the diagram, the checks and the run follow. Single-tape heads must move; give a multitape machine one symbol per tape and S is allowed.

Start from:

Moves — one per line, state, read -> state, write, move, with L or R (S on a multitape machine only). For several tapes, separate the per-tape symbols with spaces.

Start stateAccepting statesBlank symbolInput symbols

5 states, 1 tape, tape alphabet {0, 1, X, Y, B} — deterministic.

Run it

Narration

Enter a string and press Run to step through the machine.

Reading an instantaneous description§8.2.2

The state symbol is written immediately to the left of the cell being scanned, so X0q₁11 means the head is on the third cell.