Hopcroft's algorithm (DFA Minimization DFA Minimization)
Jump to navigation
Jump to search
Time Complexity
$O(kn \log n)$
Space Complexity
$O(kn)$ words
(https://link.springer.com/content/pdf/10.1007/3-540-54430-5_107.pdf)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1971