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).
-
Notifications
You must be signed in to change notification settings - Fork 0
emmanuel-h/TuringMachine
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Turing Machine solver, iterating step by step
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published