Abstract
We study the number of states of the minimal automaton of the mirror of a rational language recognized by a random deterministic automaton with n states. We prove that, for any d > 0, the probability that this number of states is greater than nd tends to 1 as n tends to infinity. As a consequence, the generic and average complexities of Brzozowski minimization algorithm are super-polynomial for the uniform distribution on deterministic automata. © 2013 Springer-Verlag.
Cite
CITATION STYLE
De Felice, S., & Nicaud, C. (2013). Brzozowski algorithm is generically super-polynomial for deterministic automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7907 LNCS, pp. 179–190). https://doi.org/10.1007/978-3-642-38771-5_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
