2008 | OriginalPaper | Buchkapitel
The Tractability Frontier for NFA Minimization
verfasst von : Henrik Björklund, Wim Martens
Erschienen in: Automata, Languages and Programming
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.