Complexity theory made easy: the formal language approach to the definition of complexity classes

  • Authors:

  • Heribert Vollmer

  • Affiliations:

  • Theoretische Informatik, Universität Hannover, Hannover

  • Venue:
  • DLT'03 Proceedings of the 7th international conference on Developments in language theory
  • Year:
  • 2003

  • Leaf language classes

    MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality

Quantified Score

Hi-index 0.00

Visualization

Abstract

In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said to be accepted if in the corresponding computation tree an accepting path exists, more general conditions on this tree are used. We survey some recent results from this context, paying particular attention to nondeterministic finite automata as well as nondeterministic polynomial-time Turing machines.