Moore's algorithm (DFA Minimization DFA Minimization)
Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2} k)$ == Space Complexity == $O(n)$ words (Derived: Auxiliary data structure that keeps track of a 'block' binary variable for each state) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1956 == Reference == https://doi.org/10.2307/2964500")
Time Complexity
$O(n^{2} k)$
Space Complexity
$O(n)$ words
(Derived: Auxiliary data structure that keeps track of a 'block' binary variable for each state)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1956