✕Line 0'setalpha' is required — declare the input alphabetsemantic
✕Line 0'setblank' is required — declare the blank symbolsemantic
✕Line 0at least 2 states are required, got 0semantic
FROM → TO
READ
WRITE
MOVE
No transitions yet. Add one above, or drag between states in the diagram.
COMPLEXITY PLOT
● TIME T(n)● SPACE S(n)
INPUT
LENGTH
TIME T(n)
SPACE S(n)
1011
4
0 steps
1 cells
Switch to NON-DETERMINISTIC mode to view the computation tree.
Ask me to build, explain, or fix a Turing machine. e.g. "build a TM that accepts a^n b^n" You can provide your own Groq API key via the ADD KEY button below.