emmanuel-h / TuringMachine

Turing Machine solver, iterating step by step

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

TuringMachine

!! App in development !!

You just have to give the numbzr of states, they will be automatically
created from q0 to qn, with qyes state in addition.

Transitions have to be typed according to this pattern :"q0 q1 a b lsr"
which means : A transition from state q0 to q1 change the a value into b.
lsr is the movement (l = left, s = stay, r = right).

About

Turing Machine solver, iterating step by step


Languages

Language:Java 100.0%