Original DFA
Minimized DFA
Partition Refinement
Accepting States
Non-accepting States
Currently Splitting
Hopcroft's Algorithm
Minimizes a DFA by finding equivalent states using partition refinement. States that can't be distinguished by any input string are merged.
Minimizes a DFA by finding equivalent states using partition refinement. States that can't be distinguished by any input string are merged.
Example DFA
Algorithm Control
Click "Step" to begin partition refinement
Statistics
0
Original
0
Minimized
0
Partitions
0
Steps