Moore'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(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.ezproxy.canberra.edu.au/10.2307/2964500")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.ezproxy.canberra.edu.au/10.2307/2964500

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