Hopcroft's algorithm (DFA Minimization DFA Minimization)

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(kn \log n)$ == Space Complexity == $O(kn)$ words (https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/3-540-54430-5_107.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1971 == Reference == https://www.cs.cmu.edu/~./sutner/CDM/papers/Hopcroft71.pdf")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(kn \log n)$

Space Complexity

$O(kn)$ words

(https://link-springer-com.ezproxy.canberra.edu.au/content/pdf/10.1007/3-540-54430-5_107.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1971

Reference

https://www.cs.cmu.edu/~./sutner/CDM/papers/Hopcroft71.pdf

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Hopcroft%27s_algorithm_(DFA_Minimization_DFA_Minimization)&oldid=45388"