On this page, you will find a Turing machine simulator, which is meant to simply and intuitively showcase
how a Turing machine works.
Before you can execute the simulator, you must fill in the following fields.
Start tape:
Here, you type in the initial word which is supposed to be on the tape initially.
Start state:
Here, you type in the state which is to be used as the start state.
Final states:
Here, you type in the states which lead to a positive end of the Turing machine.
Rules of transition:
Here, you type in all transition functions of the Turing machine.
Make sure to observe the following pattern:
[Current state] [Current symbol]
[->] [New state]
[New symbol] [Direction of movement
L/R/N]
L = Movement to the left, R = Movement to the right, N = Neutral movement
Example: [q0] [1]
[->] [q1]
[0] [R]
There are six buttons for controlling the simulator:
Reset machine (or
):
Resets the machine to its original state.
Initialize machine (or
):
Transfers the start tape to the internal storage and initializes the machine.
Pause machine (or
):
Pauses the execution of the current machine.
Execute machine (step) (or
):
Executes a single step of computation in accordance with the transition function.
Execute machine (or
):
Runs the entire program with the speed of execution being adjustable.
Load program:
Loads a predefined configuration and initializes the simulator with it.