Revuz's algorithm (Acyclic DFA Minimization DFA Minimization): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    15 February 2023

    • curprev 11:1511:15, 15 February 2023‎ Admin talk contribs‎ 381 bytes +381‎ 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.ezproxy.canberra.edu.au/science/article/pii/0304397592901423"
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Revuz%27s_algorithm_(Acyclic_DFA_Minimization_DFA_Minimization)"