Turing Machine

Description
This applet simulates a Turing Machine that is designed to recognise the language . The symbol '-' on the tape and in the transition function represents the blank symbol. '>' denotes a movement of the tape head towards right, and '<' indicates a movement towards left. q4 is the halting state.

• Input String: Specify an input string using symbols a, b in the textfield, and click the 'Start' button to start the simulation.
Due to display limitations, only a maximum of 16 characters can be used as input.