Determinization of Büchi-Automata

  • Markus Roggenbach
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)

Abstract

To determinize Büchi automata it is necessary to switch to another class of ω-automata, e.g. Muller or Rabin automata. The reason is that there exist languages which are accepted by some nondeterministic Büchi-automaton, but not by any deterministic Büchi-automaton (c.f. section 3.1).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Markus Roggenbach
    • 1
  1. 1.Bremen Institute for Safe SystemsBremen UniversityGermany

Personalised recommendations