Generalized Büchi automaton
In automata theory, generalized Büchi automaton (GBA) is a variant of Büchi automaton. The difference with the Büchi automaton is its accepting condition, i.e., a set of sets of states. A run is accepted by the automaton if it visits at least one state of every set of the accepting condition infinitely often. Generalized büchi automata (GBA) is equivalent in expressive power with Büchi automata; a transformation is given here.
Wikipage redirect
primaryTopic
Generalized Büchi automaton
In automata theory, generalized Büchi automaton (GBA) is a variant of Büchi automaton. The difference with the Büchi automaton is its accepting condition, i.e., a set of sets of states. A run is accepted by the automaton if it visits at least one state of every set of the accepting condition infinitely often. Generalized büchi automata (GBA) is equivalent in expressive power with Büchi automata; a transformation is given here.
has abstract
In automata theory, generalize ...... ifically for this translation.
@en
Wikipage page ID
28,726,554
Wikipage revision ID
691,329,697
hypernym
comment
In automata theory, generalize ...... transformation is given here.
@en
label
Generalized Büchi automaton
@en