Accept state — double ring; string accepted if ends here
ε
Epsilon — free move, no input consumed (NFA only)
a,b
Multiple labels — transitions on either symbol
① Construction Steps top-down decomposition → ε-NFA
② ε-NFA → DFA (Subset Construction)
Algorithm: For each NFA state-set reachable via a symbol, compute its ε-closure to form a DFA state. A DFA state is accepting if any member NFA state is accepting.
③ DFA → Min-DFA (Hopcroft's Algorithm)
Partition Refinement: Start with accepting / non-accepting groups. Split any group where states disagree on transitions. Stable partition → each group is one minimal state.
Partition Steps
∑
No automaton built yet
Enter a regex in the Build tab
Simulate Input
Simulation runs on the DFA
Statistics
Regex Properties
Transition Table
∅
Build an automaton first
Stats appear after building
Automatonε-NFA
Step 1 / 1
—
∑
No automaton yet
Enter a regex and press Build
Start state
Accept state
Normal state
- - -ε-transition
Transition Label
Enter symbol(s), comma-separated. Type "e" or "eps" for ε.