Measuring nondeterminism in pushdown automata

  • Authors:

  • Jonathan Goldstine;Hing Leung;Detlef Wotschke

  • Affiliations:

  • Department of Computer Science and Engineering, The Pennsylvania State University, University Park, Pennsylvania, USA;Department of Computer Science, New Mexico State University, Las Cruces, New Mexico, USA;Fachbereich Informatik, Johann Wolfgang Goethe-Universität, Frankfurt, Germany

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The amount of nondeterminism that a pushdown automaton requires to recognize an input string can be measured by the minimum number of guesses that it must make to accept the string, where guesses are measured in bits of information. When this quantity is unbounded, the rate at which it grows as the length of the string increases serves as a measure of the pushdown automaton's ''rate of consumption'' of nondeterminism. We show that this measure is similar to other complexity measures in that it gives rise to an infinite hierarchy of complexity classes of context-free languages differing in the amount of the resource (in this case, nondeterminism) that they require. In addition, we show that there are context-free languages that can only be recognized by a pushdown automaton whose nondeterminism grows linearly, resolving an open problem in the literature. In particular, the set of palindromes is such a language.