www.stacs-conf.org AMBIGUITY AND COMMUNICATION
by
Juraj Hromkovi
,
Č
,
Georg Schnitger
BibTeX
@MISC{Hromkovi_www.stacs-conf.orgambiguity,
author = {Juraj Hromkovi and Č and Georg Schnitger},
title = {www.stacs-conf.org AMBIGUITY AND COMMUNICATION},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. The ambiguity of a nondeterministic finite automaton (NFA) N for input size n is the maximal number of accepting computations of N for an input of size n. For all k, r ∈ N we construct languages Lr,k which can be recognized by NFA’s with size k·poly(r) and ambiguity O(n k), but Lr,k has only NFA’s with exponential size, if ambiguity o(n k) is required. In particular, a hierarchy for polynomial ambiguity is obtained, solving a long standing open problem (Ravikumar and Ibarra, 1989, Leung, 1998). 1.
Citations
| 46 | Communication Complexity: A Survey - Lovasz - 1990 |
| 25 | On notions of information transfer - Aho, Ullman, et al. - 1983 |
| 16 | III, On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata - Stearns, Hunt - 1985 |
| 8 | Nondeterministic Communication with a Limited Number of Advice Bits - Hromkovič, Schnitger - 2003 |
| 8 | Relating the type of ambiguity of finite automata to the succinctness of their representation - Ravikumar, Ibarra - 1989 |
| 5 | Communication complexity method for measuring nondeterminism in finite automata - Hromkovič, Karhumäki, et al. - 2002 |
| 4 | Separating exponentially ambiguous finite automata from polynomially ambiguous finite automata - Leung - 1998 |
| 2 | On the degree of ambiguity of finite automata, Theor - Weber, Seidl - 1991 |
