Turing machine diagram examples.
Same tool, four requests. Every drawing below is a real render.
Rather start from a finished drawing? Browse 40 state diagram templates →
What a Turing machine diagram is.
A Turing machine diagram is a state diagram for a machine that reads and writes symbols on an unbounded tape. A transition label normally records read/write/move, such as 1/0,L: read 1, write 0 and move the head left.
The diagram identifies the control states and the tape operation that selects each next state. Accepting and rejecting halting states make the result of the computation explicit.
- Standard
- OMG UML 2.5.1 §14 + Harel (1987) statechart
- Engine
- schematex-state
- Editable
- Double-click text, drag nodes
- Export
- SVG · PNG · PDF
Who uses Turing machine diagrams.
Small unary machines used to practise reading the transition function and tape operations.
Marking algorithms that recognize languages such as a^n b^n, beyond finite automata.
Two-phase tape scans that show how a machine moves from one input block to another.
How to make a Turing machine diagram in three steps.
Describe it
One paragraph is enough to start.
See the drawing
Drawn by the right engine.
Say what changes
Every edit keeps a version.
Common questions
What does a Turing machine transition label show?
It shows the tape symbol read, the symbol written and the direction the head moves. For example, 1/B,R means read 1, write blank and move right.
How are accept and reject states shown?
An accepting state is a halting final state, usually drawn with a double circle. A separate reject state can be included when the machine must show an explicit unsuccessful halt.
How do I describe a Turing machine?
State the input alphabet, the language or task, then describe what the machine does in each phase: what it reads, writes, moves over and when it halts.
What do L, R and S mean?
They are tape-head movements: L moves left, R moves right and S leaves the head on the current tape cell.
Can a Turing machine diagram show a marking algorithm?
Yes. Name the marker symbols and explain which input symbols are paired or skipped. The state diagram can show the scan, mark, return and checking phases.
Other drawings for the same work.
Draw your first Turing machine now.
Free account, no card. Describe the computation and see the state diagram in under a minute.
Open the editor