Determinization of Büchi-Automata

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


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).


Transition Function Reachable State Deterministic Variant Extra Component Deterministic Automaton 
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.


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