Almeida & Zeitoun (Cyclic Nontrivial SCCs DFA Minimization DFA Minimization): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(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 == 2008 == Reference == https://www.labri.fr/perso/zeitoun/research/pdf/Almeida-Zeitoun-IPL2008.pdf")
 
(No difference)

Latest revision as of 12:15, 15 February 2023

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

2008

Reference

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Almeida_%26_Zeitoun_(Cyclic_Nontrivial_SCCs_DFA_Minimization_DFA_Minimization)&oldid=45391"