Brzozowski's algorithm (DFA Minimization DFA Minimization)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O({2}^n)$ words (http://www.cs.ru.nl/bachelors-theses/2017/Erin_van_der_Veen___4431200___The_Practical_Performance_of_Automata_Minimization_Algorithms.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1963 == Reference == https://www.semanticscholar.org/paper/Canonical-regular-expressions-and-minimal-state-for-...")
Time Complexity
$O({2}^n)$
Space Complexity
$O({2}^n)$ words
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1963