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)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
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
The Tractability Frontier for NFA Minimization
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
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
Economy of description by automata, grammars, and formal systems
SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)
Simplifying XML schema: effortless handling of nondeterministic regular expressions
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
Theoretical Computer Science
Tight Bounds on the Descriptional Complexity of Regular Expressions
DLT '09 Proceedings of the 13th International Conference on Developments in Language Theory
Regular Expressions with Numerical Constraints and Automata with Counters
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Hyper-minimisation Made Efficient
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Regular Expressions with Counting: Weak versus Strong Determinism
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
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
Succinctness of regular expressions with interleaving, intersection and counting
Theoretical Computer Science
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science
Unambiguous finite automata over a unary alphabet
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
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
Unambiguous finite automata over a unary alphabet
Information and Computation
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Hi-index | 0.00 |
We prove that minimizing finite automata is NP-hard for almost all classes of automata that extend the class of deterministic finite automata. More specifically, we show that minimization is NP-hard for all finite automata classes that subsume the class of @dNFAs which accept strings of length at most three. Here, @dNFAs are the finite automata that are unambiguous, allow at most one state q with a non-deterministic transition for at most one alphabet symbol a, and are allowed to visit state q at most once in a run. As a corollary, we also obtain that the same result holds for all finite automata classes that subsume that class of finite automata that are unambiguous, have at most two initial states, and accept strings of length at most two.