Skip to content

Latest commit

 

History

6 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 

Repository files navigation

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

Topics

Resources

Stars

1 star

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages