Finite automata and unary languages
Theoretical Computer Science
Communication complexity hierarchy
Theoretical Computer Science
Parsing theory. Vol. 1: languages and parsing
Parsing theory. Vol. 1: languages and parsing
Relating the type of ambiguity of finite automata to the succinctness of their representation
SIAM Journal on Computing
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Partial orders on words, minimal elements of regular languages, and state complexity
Theoretical Computer Science
SIAM Journal on Computing
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Algorithmic number theory
A comparison of two lower-bound methods for communication complexity
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
SIAM Journal on Computing
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Communication complexity method for measuring nondeterminism in finite automata
Information and Computation
Translating regular expressions into small εe-free nondeterministic finite automata
Journal of Computer and System Sciences
Communication Complexity and Sequential Compuation
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Randomized Communication Protocols (A Survey)
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
A lower bound on the size of ɛ-free NFA corresponding to a regular expression
Information Processing Letters
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
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 equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
On the separation between k-party and (k - 1)-party nondeterministic message complexities
DLT'02 Proceedings of the 6th international conference on Developments in language theory
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
Descriptional and computational complexity of finite automata---A survey
Information and Computation
| Hi-index | 0.00 |
In contrast to the minimization of deterministic finite automata (DFA's), the task of constructing a minimal nondeterministic finite automaton (NFA) for a given NFA is PSPACE-complete. This fact motivates the following computational problems:(i) Find a minimal NFA for a regular language L, if Lis given by another suitable formal description, resp. come up with a small NFA.(ii) Estimate the size of minimal NFA's or find at least a good approximation of their sizes.Here, we survey the known results striving to solve the problems formulated above and show that also for restricted versions of minimization of NFA's there are no efficient algorithms.Since one is unable to efficiently estimate the size of a minimal NFA in an algorithmic way, one can ask at least for developing mathematical proof methods that help in proving good lower bounds on the size of a minimal NFA for a given regular language. We show here that even the best known methods for this purpose fail for some concrete regular languages.Finally, we give an overview of the results about the influence of the degree of ambiguity on the size of NFA's and discuss the relation between the descriptional complexity of NFA's and NFA's with 茂戮驴-transitions.