nondeterministic Muller automaton
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:Technical_Machine
gptkb:Muller_automaton gptkb:nondeterministic_automaton |
| gptkbp:acceptsIf |
set of states visited infinitely often is in acceptance set
|
| gptkbp:allows |
infinite words
|
| gptkbp:hasAcceptanceCondition |
gptkb:Muller_acceptance_condition
|
| gptkbp:hasAcceptanceSet |
set of sets of states
|
| gptkbp:hasStateSet |
finite set
|
| gptkbp:hasTransitionRelation |
nondeterministic
|
| gptkbp:inputAlphabet |
finite alphabet
|
| gptkbp:namedAfter |
gptkb:David_E._Muller
|
| gptkbp:relatedTo |
gptkb:deterministic_Muller_automaton
gptkb:Rabin_automaton gptkb:Büchi_automaton gptkb:Streett_automaton |
| gptkbp:transitionFunction |
nondeterministic transition relation
|
| gptkbp:usedFor |
recognizing omega-regular languages
|
| gptkbp:usedIn |
theory of computation
|
| https://www.w3.org/2000/01/rdf-schema#label |
nondeterministic Muller automaton
|