Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
acceptance condition
|
| gptkbp:acceptsIf |
there exists a pair (E_i, F_i) such that F_i is visited infinitely often and E_i only finitely often
|
| gptkbp:appliesTo |
infinite words
|
| gptkbp:characterizedBy |
set of pairs of state sets (E_i, F_i)
|
| gptkbp:contrastsWith |
gptkb:Büchi_acceptance_condition
gptkb:Streett_acceptance_condition Parity acceptance condition |
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Rabin acceptance condition
|
| gptkbp:introducedIn |
1972
|
| gptkbp:namedAfter |
gptkb:Michael_O._Rabin
|
| gptkbp:usedBy |
gptkb:Rabin_automaton
deterministic automata |
| gptkbp:usedIn |
automata theory
ω-automata |
| gptkbp:bfsParent |
gptkb:Rabin_automaton
|
| gptkbp:bfsLayer |
6
|