Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Technical Machine
|
| gptkbp:allows |
regular languages
|
| gptkbp:field |
automata theory
theoretical computer science |
| gptkbp:hasProperty |
transition function
accepting states finite number of states input alphabet equivalence of deterministic and nondeterministic automata |
| gptkbp:hasVariant |
gptkb:deterministic_finite_automaton
gptkb:nondeterministic_finite_automaton |
| https://www.w3.org/2000/01/rdf-schema#label |
Rabin–Scott automata
|
| gptkbp:introducedIn |
gptkb:Finite_Automata_and_Their_Decision_Problems
1959 |
| gptkbp:namedAfter |
gptkb:Dana_Scott
gptkb:Michael_O._Rabin |
| gptkbp:relatedTo |
Technical Machine
pushdown automaton regular expressions |
| gptkbp:type |
finite automaton
|
| gptkbp:usedFor |
formal language recognition
|
| gptkbp:bfsParent |
gptkb:Michael_Rabin
gptkb:Michael_O._Rabin |
| gptkbp:bfsLayer |
5
|