Complementation of Büchi Automata Using Alternation

  • Felix Klaedtke
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)


Büchi presented in [18] a natural acceptance condition allowing nondeterministic finite-state automata to define languages of infinite words: An automaton accepts an infinite word if there is a run that passes through a final state infinitely often. Such an automaton is called a Büchi automaton. Complementation of Büchi automata is not obvious.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Felix Klaedtke
    • 1
  1. 1.Institut für InformatikAlbert-Ludwigs-UniversitätFreiburg i. Br.Germany

Personalised recommendations