Complementation of Büchi automaton
In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω-regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves that the set of ω-regular languages and Büchi automata are closed under complementation.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Complementation of Büchi automaton
In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω-regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves that the set of ω-regular languages and Büchi automata are closed under complementation.
has abstract
In automata theory, complement ...... t and optimal complementation.
@en
Wikipage page ID
31,683,785
page length (characters) of wiki page
Wikipage revision ID
994,358,069
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In automata theory, complement ...... closed under complementation.
@en
label
Complementation of Büchi automaton
@en