CIT 596 Turing Machine simulator
Spring 2012, David Matuszek

I wrote a little Turing Machine simulator over the weekend. It's no real competition for JFLAP, but it does take input in a different form. JFLAP uses diagrams, but a TM can also be described textually. The transition function δ can be specified as a set of 5-tuples of the form:(current state, symbol read, symbol written, direction, next state), and reasonable defaults can be used for the other characteristics.

Here are the details:

I would be happy to have students rewrite the program in their favorite language--it would be a nice thing to contribute to the class. I may do some additional languages myself.