Visual Turing Machine Simulator

A compiler and visualization engine for Turing Machine rules (State / Read / Write / Move / Next).

Turing Tape

Current State: q0 Steps: 0 Idle

State Transition Rules

Format: CurrentState ReadSymbol WriteSymbol Direction NextState. Use _ for blank.

How to write rules

The machine consists of an infinite tape and a read/write head.


Syntax: 
State  Read  Write  Dir  NextState
  • State: Arbitrary string (start is always 'q0')
  • Read: Symbol on tape under head
  • Write: Symbol to write to tape
  • Dir: 'L' (Left), 'R' (Right), or '*' (Stay)
  • NextState: The state to transition to (use 'halt' to stop)
  • Blank Symbol: '_' represents empty tape