Determinization of Büchi-Automata

  • Roggenbach M
N/ACitations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

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

Cite

CITATION STYLE

APA

Roggenbach, M. (2002). Determinization of Büchi-Automata (pp. 43–60). https://doi.org/10.1007/3-540-36387-4_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free