The Tractability Frontier for NFA Minimization

DOI10.1007/978-3-540-70583-3_3MaRDI QIDQ3520301zbMATH OpenOpenAlexFDO

Authors Henrik Björklund, Wim Martens

Publication date 19 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70583-3_3

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Formal languages and automata (68Q45)

Recommendations

• The tractability frontier for NFA minimization
• Minimizing finite automata is computationally hard
• scientific article; zbMATH DE number 176769
• On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes
• scientific article; zbMATH DE number 2040922

Cited in

(14)

• Generating, sampling and counting subclasses of regular tree languages
• Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
• scientific article; zbMATH DE number 5527901 (Why is no real title available?)
• Descriptional and Computational Complexity of Finite Automata
• scientific article; zbMATH DE number 176769 (Why is no real title available?)
• The tractability frontier for NFA minimization
• scientific article; zbMATH DE number 2040906 (Why is no real title available?)
• scientific article; zbMATH DE number 1927179 (Why is no real title available?)
• scientific article; zbMATH DE number 1929949 (Why is no real title available?)
• Minimization of visibly pushdown automata is NP-complete
• Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP
• Descriptional and computational complexity of finite automata -- a survey
• Random deterministic automata with one added transition
• Minimizing finite automata is computationally hard

This page was built for publication: The Tractability Frontier for NFA Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520301)