Skip to Main content Skip to Navigation
Conference papers

Ambiguity and Communication

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 2 N we construct languages Lr,k which can be recognized by NFA's with size k poly(r) and ambiguity O(nk), but Lr,k has only NFA's with exponential size, if ambiguity o(nk) is required. In particular, a hierarchy for polynomial ambiguity is obtained, solving a long standing open problem (Ravikumar and Ibarra, 1989, Leung, 1998).
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, February 10, 2009 - 3:26:00 PM
Last modification on : Thursday, May 27, 2021 - 1:54:05 PM
Long-term archiving on: : Tuesday, June 8, 2010 - 7:18:40 PM


Files produced by the author(s)


  • HAL Id : inria-00360175, version 1
  • ARXIV : 0902.2140



Juraj Hromkovic, Georg Schnitger. Ambiguity and Communication. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.553-564. ⟨inria-00360175⟩



Record views


Files downloads