Advertisement

Büchi Automata

  • Bakhadyr Khoussainov
  • Anil Nerode
Chapter
Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 21)

Abstract

Finite automata theory, studied in the previous chapter, can be viewed as a theory that investigates problem oriented computations. Generally speaking, problem oriented computations solve certain problems about data. Computer programmers as well as users deal with problem oriented computations daily. A programmer, given a computer program and an input, runs the program on the input, and the program gives an output upon termination thus solving a certain problem about the input. Therefore, for these programs, nontermination is considered to be a failure.

Keywords

Order Logic Finite Index Finite Automaton Successor Function Transition Table 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2001

Authors and Affiliations

  • Bakhadyr Khoussainov
    • 1
  • Anil Nerode
    • 2
  1. 1.Department of Computer ScienceThe University of AucklandAucklandNew Zealand
  2. 2.Department of MathematicsCornell UniversityIthacaUSA

Personalised recommendations