deterministic Muller automaton
GPTKB entity
Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:finite_automaton
gptkb:Technical_Machine |
| gptkbp:acceptanceCondition |
Muller condition
|
| gptkbp:allows |
infinite words
|
| gptkbp:alphabet |
finite
|
| gptkbp:closed |
closed under intersection
closed under union closed under complementation |
| gptkbp:determinism |
deterministic
|
| gptkbp:expressivePower |
omega-regular languages
|
| gptkbp:firstDescribed |
1963
|
| gptkbp:input |
infinite sequence of symbols
|
| gptkbp:namedAfter |
gptkb:David_E._Muller
|
| gptkbp:output |
accept or reject
|
| gptkbp:relatedTo |
gptkb:Rabin_automaton
gptkb:Büchi_automaton gptkb:Streett_automaton |
| gptkbp:stateSet |
finite
|
| gptkbp:transitionFunction |
deterministic
|
| gptkbp:usedIn |
formal language theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
deterministic Muller automaton
|