(Non-deterministic) Turing machine simulator
Turing machine description
;The following example gives a Turing machine that accepts words of the form w mirror(w). For e.g., aabbaa. ;States t and t' are just here to show how non-determinism works. ;Each line is a transition of the form <state> <letter-to-read> <letter-to-write> <direction> <endstate>. ;Direction can be l (left), r (right) or . (stay). 0 a _ r 1a 0 a _ r t 0 b _ r 1b 0 _ _ r acc 1a a a r 1a 1a b b r 1a 1b a a r 1b 1b b b r 1b 1a _ _ l 2a 1b _ _ l 2b 2a a _ l 3 2a b _ . rej 2b b _ l 3 2b a _ . rej 3 a a l 3 3 b b l 3 3 _ _ r 0 t a a r t' t a a r t t' b b . rej
Input:
