Three partition refinement algorithms
SIAM Journal on Computing
SIAM Journal on Computing
On the state complexity of k-entry deterministic finite automata
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Measures of Nondeterminism in Finite Automata
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Minimizing finite automata is computationally hard
Theoretical Computer Science - Developments in language theory
Comparing the size of NFAs with and without ε-transitions
Theoretical Computer Science
Minimizing nfa's and regular expressions
Journal of Computer and System Sciences
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Descriptional complexity of nondeterministic finite automata
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Regular expressions and NFAs without Ε-transitions
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Finding lower bounds for nondeterministic state complexity is hard
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Minimization of non-deterministic automata with large alphabets
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Nondeterministic Finite Automata--Recent Results on the Descriptional and Computational Complexity
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Descriptional and Computational Complexity of Finite Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Descriptional complexity of (un)ambiguous finite state machines and pushdown automata
RP'10 Proceedings of the 4th international conference on Reachability problems
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Generating, sampling and counting subclasses of regular tree languages
Proceedings of the 14th International Conference on Database Theory
Descriptional and computational complexity of finite automata---A survey
Information and Computation
The tractability frontier for NFA minimization
Journal of Computer and System Sciences
| Hi-index | 0.00 |
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 qwith a non-deterministic transition for at most one alphabet symbol a, and is allowed to visit state qat most once in a run. Furthermore, this result holds even for automata that only accept finite languages.