Turing machines
Multitape
Two dimensional
Transformations
To binary alphabet
To one way tape
Two tapes to one
Settings
Multitape Turing machine
Simulation
State
Definition
Mirror right
Mirror left
Copy
Create 2 spaces
Remove up to 2 spaces
Test #1
Test #2
Palindrome
a^n b^n c^n
AND
XOR
Test #5
Binary addition
Alphabet
Input tapes
☐
|
Start state
Final states
Transitions
// poznamka (q0, a) -> (q0, a, R) (q0, b) -> (q0, b, R) (q0, ☐) -> (q1, ☐, L) (q1, a) -> (qA, A, R) (q1, b) -> (qB, B, R) (q1, ☐) -> (q2, ☐, R) (q1, A) -> (q1, A, L) (q1, B) -> (q1, B, L) (qA, A) -> (qA, A, R) (qA, B) -> (qA, B, R) (qA, ☐) -> (q1, A, L) (qB, A) -> (qB, A, R) (qB, B) -> (qB, B, R) (qB, ☐) -> (q1, B, L) (q2, A) -> (q2, a, R) (q2, B) -> (q2, b, R) (q2, ☐) -> (qK, ☐, 0)
Solve
Moves (52)