Define states, a transition function and an input tape. Step through execution one move at a time
or run to completion. Three built-in examples: 0ⁿ1ⁿ recognition, string copying, and simple accept-all.
Covers AQA 7517 Section 3.2 — Theory of Computation.
How to use:
Load an example above, or define your own machine.
Load tape to initialise.
Step → executes one transition.
Run all executes to acceptance/rejection (max 500 steps).
The head position is shown by the blue highlighted cell and ▲ marker.
Blank cells show □ (the blank symbol B).