An interactive web tool that visually teaches the table-filling algorithm for DFA minimization. Build automata, test strings, and watch state equivalence classes form — all in the browser.
O(n²)
Table-filling complexity
∞
Alphabet symbols supported
2
Live canvases
0
Dependencies on servers
Every feature is designed to make formal language theory tangible — from drawing states to watching the algorithm converge.
Run the full table-filling algorithm with step-by-step visualization showing exactly which state pairs are distinguishable.
Watch a token travel along transitions in real-time as you test strings against your DFA, with accept/reject highlighting.
View your DFA as a formal transition function table alongside the visual canvas for both original and minimized forms.
8 curated DFA examples covering edge cases: unreachable states, all-accepting, already minimal, and multi-symbol alphabets.
Export your DFA as JSON for sharing or backup. Import previously saved DFAs. Export the minimized DFA as a PNG image.
Let the algorithm run itself at adjustable speed — ideal for presentations, lectures, or self-study sessions.
5 steps from any DFA to its minimal equivalent
Remove unreachable
BFS from start state — remove states never visited
Make total
Inject a dead/trap state for missing transitions
Base case
Mark all (final, non-final) pairs as distinguishable
Propagate
Follow transitions to mark more pairs iteratively
Merge
Unmarked pairs → same equivalence class → one state