Communication complexity hierarchy
Theoretical Computer Science
SIAM Journal on Computing
A lower bound technique for the size of nondeterministic finite automata
Information Processing Letters
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Automaticity I: properties of a measure of descriptional complexity
Journal of Computer and System Sciences
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
Automaticity II: descriptional complexity in the unary case
Theoretical Computer Science
Communication complexity and parallel computing
Communication complexity and parallel computing
Communication complexity
Automaticity III: polynomial automaticity and context-free languages
Computational Complexity
Journal of Automata, Languages and Combinatorics
On the power of Las Vegas for one-way communication complexity, OBDDs, and finite automata
Information and Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh 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
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
An n log n algorithm for minimizing states in a finite automaton
An n log n algorithm for minimizing states in a finite automaton
A complexity theory for VLSI
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
On the Hardness of Determining Small NFA's and of Proving Lower Bounds on Their Sizes
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Theoretical Computer Science
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
DLT'07 Proceedings of the 11th international conference on Developments in language theory
| Hi-index | 0.01 |
Despite the facts that automata theory is one of the oldest and most extensively investigated areas of theoretical computer science, and finite automaton is the simplest model of computation, there are still principal open problems about finite automata. One of them is to estimate, for a regular language L, the size of the minimal nondeterministic finite automaton accepting L. Currently, we do not have any method that would at least assure an approximation of this value, however, a lower bound could be obtained by noticing that the sizes of the minimal deterministic finite automaton and a minimal nondeterministic finite automaton can only be exponentially apart from each other. The best known technique for proving lower bound on the size of the minimal nondeterministic finite automata is based on communication and this technique covers all previously used approaches. Unfortunately, there exist regular languages with an exponential gap between the communication complexity lower bound and the size of a minimal nondeterministic finite automaton. The contribution of this paper is to improve the communication complexity lower bound technique in order to get essentially better lower bounds for some regular languages.