Ambiguity and Communication - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Ambiguity and Communication

Georg Schnitger
  • Function : Author
  • PersonId : 857991


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).
Fichier principal
Vignette du fichier
hromkovic_new.pdf (216.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00360175 , version 1 (10-02-2009)


  • 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⟩


46 View
198 Download



Gmail Facebook X LinkedIn More