RE
→
NFA
→
DFA
→
Min-DFA
Theory of Computation
Regex Input
→
NFA
→
DFA
→
Min-DFA
Regex:
▶ Run Pipeline
✕ Clear
Operators:
*
Kleene star ·
+
union (OR) ·
()
grouping · Concatenation is implicit
Presets:
(a+b)*abb
a*b*
(a*+b)ab*
ab+cd
a(b+c)*d
(aa+bb)*
(a+b)*(aa+bb)
NFA
—
states
—
transitions
—
ε-moves
DFA
—
states
—
transitions
Min-DFA
—
states
—
states removed
NFA
Each regex operator maps to an NFA fragment. ε = epsilon transition.
+
−
reset
—
States:
—
ε-transitions:
—
Symbol transitions:
—
◈
Enter a regex and click Run Pipeline
symbol transition
ε transition
accept state
start state
View Step-by-Step: Regex → NFA Conversion ↗
DFA
Each DFA state represents a set of NFA states reached together.
+
−
reset
—
States:
—
Transitions:
—
◈
NFA will convert here
D0, D1...
DFA states
accept state
View Step-by-Step: NFA → DFA Conversion ↗
Min-DFA (Myhill-Nerode)
Indistinguishable DFA states are merged. Minimal state count for this language.
+
−
reset
—
States:
—
Reduced from:
—
◈
DFA will minimize here
M0, M1...
minimized states
accept state
View Step-by-Step: DFA → Min-DFA ↗
⚡ String Tester — Live Traversal
Test Instant
Min-DFA
DFA
NFA
⏭
Step
▶
Play
↺
Reset
Tape:
⚡ Active Machine Simulation
Live traversal happens here
SIMULATION
+
−
Reset
◈
Choose a machine and start testing
Transition Tables
DFA Transition Table
Min-DFA Transition Table
Run the pipeline to see transition tables.