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).
CITATION STYLE
Roggenbach, M. (2002). Determinization of Büchi-Automata (pp. 43–60). https://doi.org/10.1007/3-540-36387-4_3
Mendeley helps you to discover research relevant for your work.