Deterministic finite automaton runner
Run a symbol sequence through a deterministic transition table and inspect acceptance, state trace and missing transitions.
The example value has been entered. Check it immediately or change the value.
Input is processed in the browser. Refreshing returns a sample value.
Instructions and example
qᵢ₊₁=δ(qᵢ,sᵢ); accept when the final state∈F.
With the default transitions, input 1 0 1 follows even→odd→odd→even and is accepted.
At most 30 states, 20 symbols, 100 transitions and 200 input symbols. Names use alphanumerics, underscore or hyphen, up to 20 characters. Duplicate transitions are rejected; empty input is allowed. Floating-point results display at most 12 significant digits.
Frequently asked questions
What happens when an input transition is missing?
The sequence is rejected at that position, showing its index and the trace so far. No transition is inserted.
When is an empty symbol sequence accepted?
Only when the start state is accepting. Epsilon transitions and nondeterministic branching are unsupported.
Calculation criteria and reference materials
- MIT: finite state machines
Deterministic state transitions driven by input symbols.
Verification of calculation criteria: · Calculation·verification principles · Report errors