Myhill–Nerode Theorem · Table-Filling Algorithm

Minimize
any DFA
step by step.

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.

8Example DFAs
41Unit tests
100%Browser-native
Explore

O(n²)

Table-filling complexity

∞

Alphabet symbols supported

2

Live canvases

0

Dependencies on servers

Everything you need

Built for learning & teaching

Every feature is designed to make formal language theory tangible — from drawing states to watching the algorithm converge.

Myhill–Nerode Minimization

Run the full table-filling algorithm with step-by-step visualization showing exactly which state pairs are distinguishable.

Animated String Simulation

Watch a token travel along transitions in real-time as you test strings against your DFA, with accept/reject highlighting.

δ Transition Table

View your DFA as a formal transition function table alongside the visual canvas for both original and minimized forms.

Example Library

8 curated DFA examples covering edge cases: unreachable states, all-accepting, already minimal, and multi-symbol alphabets.

Import & Export

Export your DFA as JSON for sharing or backup. Import previously saved DFAs. Export the minimized DFA as a PNG image.

Auto-play Steps

Let the algorithm run itself at adjustable speed — ideal for presentations, lectures, or self-study sessions.

How minimization works

5 steps from any DFA to its minimal equivalent

1

Remove unreachable

BFS from start state — remove states never visited

2

Make total

Inject a dead/trap state for missing transitions

3

Base case

Mark all (final, non-final) pairs as distinguishable

4

Propagate

Follow transitions to mark more pairs iteratively

5

Merge

Unmarked pairs → same equivalence class → one state

Ready to minimize your DFA?

Build your automaton, run the algorithm, and export the result — all in your browser, no account needed.