On sparseness, ambiguity and other decision problems for acceptors and transducers
3rd annual symposium on theoretical aspects of computer science on STACS 86
Communication complexity hierarchy
Theoretical Computer Science
Relating the type of ambiguity of finite automata to the succinctness of their representation
SIAM Journal on Computing
On measuring nondeterminism in regular languages
Information and Computation
On the relation between ambiguity and nondeterminism in finite automata
Information and Computation
Non-deterministic communication complexity with few witnesses
Journal of Computer and System Sciences
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
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
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
Automata, Languages, and Machines
Automata, Languages, and Machines
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
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
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
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
Succinctness of descriptions of context-free, regular and finite languages.
Succinctness of descriptions of context-free, regular and finite languages.
A complexity theory for VLSI
State complexity of some operations on binary regular languages
Theoretical Computer Science - Descriptional complexity of formal systems
Context-dependent nondeterminism for pushdown automata
Theoretical Computer Science
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
State complexity of unique rational operations
Theoretical Computer Science
Nondeterministic state complexity of nested word automata
Theoretical Computer Science
Theoretical Computer Science
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
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
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
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
Comparing necessary conditions for recognizability of two-dimensional languages
CAI'11 Proceedings of the 4th international conference on Algebraic informatics
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
Theoretical Computer Science
Unambiguous finite automata over a unary alphabet
Information and Computation
State complexity of concatenation and complementation of regular languages
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Context-Dependent nondeterminism for pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
State complexity and limited nondeterminism
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.01 |
While deterministic finite automata seem to be well understood,surprisingly many important problems concerning nondeterministicfinite automata (nfa's) remain open. One such problem area is thestudy of different measures of nondeterminism in finite automataand the estimation of the sizes of minimal nondeterministic finiteautomata. In this paper the concept of communication complexity isapplied in order to achieve progress in this problem area. The mainresults are as follows:(1) Deterministic communication complexityprovides lower bounds on the size of nfa's with boundedunambiguity. Applying this fact, the proofs of several resultsabout nfa's with limited ambiguity can be simplified and presentedin a uniform way. (2) There is a family of languagesKONk2 with an exponential size gapbetween nfa's with polynomial leaf number/ambiguity and nfa's withambiguity k. This partially provides an answer to the openproblem posed by B. Ravikumar and O. Ibarra (1989, SIAM J. Comput.18, 1263-1282) and H. Leung (1998, SIAM J. Comput. 27, 1073-1082).