Finite State Machine Stepper
Step a deterministic state machine through supplied symbols.
Processing stays in your browser. Implements a finite-state machine, not a Turing tape. Missing transitions stop with a rejection report; duplicate transitions are rejected.
How to use the finite state machine stepper
Step a deterministic state machine through supplied symbols. Complete the transitions json array [state, symbol, next], start state, accepting states (comma-separated), input symbols json array fields above, or upload a UTF-8 text file for transitions json array [state, symbol, next]. Choose Run tool, review the output, then copy or download the result.
Example
Two 1 symbols return the example machine to even.
Good to know
Implements a finite-state machine, not a Turing tape. Missing transitions stop with a rejection report; duplicate transitions are rejected.