Revuz's algorithm (Acyclic DFA Minimization DFA Minimization)

From Algorithm Wiki

Revision as of 12:15, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ words (https://www.labri.fr/perso/zeitoun/research/pdf/Almeida-Zeitoun-IPL2008.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1992 == Reference == https://www.sciencedirect.com/science/article/pii/0304397592901423")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n)$

Space Complexity

$O(n)$ words

(https://www.labri.fr/perso/zeitoun/research/pdf/Almeida-Zeitoun-IPL2008.pdf)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1992

Reference

https://www.sciencedirect.com/science/article/pii/0304397592901423

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Revuz%27s_algorithm_(Acyclic_DFA_Minimization_DFA_Minimization)&oldid=45392"