Skip to main content
Book Chapter

Complementation of Büchi Automata Using Alternation

  • Klaedtke F
DOI: 10.1007/3-540-36387-4_4
N/ACitations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Büchi presented in [18] a natural acceptance condition allowing nondeterministic finite-state automata to define languages of infinite words: An automaton accepts an infinite word if there is a run that passes through a final state infinitely often. Such an automaton is called a Büchi automaton. Complementation of Büchi automata is not obvious.

Cite

CITATION STYLE

APA

Klaedtke, F. (2002). Complementation of Büchi Automata Using Alternation (pp. 61–77). https://doi.org/10.1007/3-540-36387-4_4

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