Turing machines
Multitape
Two dimensional
Transformations
To binary alphabet
To one way tape
Two tapes to one
Settings
Two dimensional Turing machine
Simulation
State
Definition
XOR Matrix
Test #3
Test #4
Alphabet
Input rows
☐
|
Start state
Final states
Transitions
(p, 1) -> (q1, ☐, R) (p, 0) -> (q0, ☐, R) (p, #) -> (t, ☐, R) (s, _0) -> (s, _0, L) (s, _1) -> (s, _1, L) (s, #) -> (s, #, L) (s, 0) -> (s, 0, L) (s, 1) -> (s, 1, L) (s, ☐) -> (p, ☐, R) (q1, 0) -> (q1, 0, R) (q1, 1) -> (q1, 1, R) (q1, #) -> (r1, #, R) (q0, 0) -> (q0, 0, R) (q0, 1) -> (q0, 1, R) (q0, #) -> (r0, #, R) (r1, _0) -> (r1, _0, R) (r1, _1) -> (r1, _1, R) (r1, 0) -> (s, _1, L) (r1, 1) -> (s, _0, L) (r1, ☐) -> (e, ☐, 0) (r0, _0) -> (r0, _0, R) (r0, _1) -> (r0, _1, R) (r0, 0) -> (s, _0, L) (r0, 1) -> (s, _1, L) (r0, ☐) -> (e, ☐, 0) (z, 0) -> (z, 0, L) (z, 1) -> (z, 1, L) (z, #) -> (z, #, L) (z, ☐) -> (p, ☐, R) (t, _0) -> (t, 0, R) (t, _1) -> (t, 1, R) (t, 0) -> (e, 0, 0) (t, 1) -> (e, 0, 0) (t, ☐) -> (x, ☐, D) (x, ☐) -> (y, ☐, L) (y, ☐) -> (n, ☐, U) (y, 0) -> (z, 0, L) (y, 1) -> (z, 1, L) (n, 1) -> (n, 1, U) (n, 0) -> (n, 0, U) (n, ☐) -> (m, ☐, D) (m, 0) -> (m, 0, L) (m, 1) -> (m, 1, L) (m, ☐) -> (f, ☐, R)
Solve
Moves (246)