Turing Machine

Description
This applet simulates a Turing Machine that is designed to copy a string containing n 1's. The TM halts by leaving 2n 1's on the tape. The symbol '-' represents the blank symbol. '>' denotes a movement of the tape head towards right, and '<' indicates a movement towards left. q5 is the halting state.

• Input String: Input a string of 1's in the textfield, and click the 'Start' button to start the simulation.
Due to display limitations, only a maximum of 8 characters can be used as input.