Determinization of Büchi-Automata
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).
KeywordsTransition Function Reachable State Deterministic Variant Extra Component Deterministic Automaton
Unable to display preview. Download preview PDF.