Abstract
We essentially show that minimizing finite automata is NP-hard as soon as one deviates from the class of deterministic finite automata. More specifically, we show that minimization is NP-hard for all finite automata classes that subsume the class that is unambiguous, allows at most one state q with a non-deterministic transition for at most one alphabet symbol a, and is allowed to visit state q at most once in a run. Furthermore, this result holds even for automata that only accept finite languages. © 2008 Springer-Verlag.
Cite
CITATION STYLE
Björklund, H., & Martens, W. (2008). The tractability frontier for NFA minimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5126 LNCS, pp. 27–38). https://doi.org/10.1007/978-3-540-70583-3_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
