Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Technical Machine
|
| gptkbp:acceptanceCondition |
Muller condition
|
| gptkbp:allows |
infinite words
|
| gptkbp:application |
formal verification
model checking |
| gptkbp:deterministicVersion |
gptkb:deterministic_Muller_automaton
|
| gptkbp:field |
automata theory
theoretical computer science |
| gptkbp:hasAcceptanceSet |
set of sets of states
|
| gptkbp:hasInputAlphabet |
finite
|
| gptkbp:hasStateSet |
finite
|
| https://www.w3.org/2000/01/rdf-schema#label |
Muller automaton
|
| gptkbp:introducedIn |
1963
|
| gptkbp:namedAfter |
gptkb:David_E._Muller
|
| gptkbp:nondeterministicVersion |
gptkb:nondeterministic_Muller_automaton
|
| gptkbp:relatedTo |
gptkb:Rabin_automaton
gptkb:Büchi_automaton gptkb:Streett_automaton |
| gptkbp:usedIn |
theory of ω-automata
|
| gptkbp:bfsParent |
gptkb:Automata_theory
|
| gptkbp:bfsLayer |
5
|