Statements (16)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:acceptance_condition
|
| gptkbp:appliesTo |
infinite words
|
| gptkbp:contrastsWith |
gptkb:Rabin_acceptance_condition
gptkb:Streett_acceptance_condition gptkb:Muller_acceptance_condition Parity acceptance condition |
| gptkbp:defines |
A run is accepting if it visits some accepting state infinitely often.
|
| gptkbp:field |
automata theory
|
| gptkbp:introducedIn |
1962
|
| gptkbp:namedAfter |
gptkb:Julius_Richard_Büchi
|
| gptkbp:relatedTo |
ω-automata
|
| gptkbp:usedIn |
gptkb:Büchi_automaton
|
| gptkbp:bfsParent |
gptkb:Büchi_automaton
gptkb:Rabin_acceptance_condition |
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Büchi acceptance condition
|