CS Vis
Algorithms
Turing Machine
DFA
NFA
About
Contact
CS Vis
✕
Turing Machine
DFA
NFA
Algorithms
Graphs & Trees
Sorting
Searching & Arrays
Dynamic Programming
Divide & Conquer
Greedy Algorithms
About
Contact
N-Tape Turing Machine
Share
Editor
Documentation
Save
Load
Reset
# N-Tape Turing Machine Configuration states: q0: transitions: - tapeReads: ['0', '_'] nextState: q1 tapeWrites: ['0', 'X'] tapeMovements: ['R', 'R'] q1: transitions: - tapeReads: ['1', 'X'] nextState: qaccept tapeWrites: ['1', 'X'] tapeMovements: ['S', 'S'] - tapeReads: ['_', '_'] nextState: qreject tapeWrites: ['_', '_'] tapeMovements: ['S', 'S'] qaccept: transitions: [] qreject: transitions: [] tapes: - name: Input alphabet: ['0', '1', '_'] - name: Work alphabet: ['0', '1', 'X', '_'] initialState: q0 acceptStates: - qaccept rejectStates: - qreject