Statements (33)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Technical Machine
theoretical computer science |
| gptkbp:allows |
context-free languages
|
| gptkbp:alphabet |
input alphabet
stack alphabet |
| gptkbp:cannotRecognize |
context-sensitive languages
|
| gptkbp:configuration |
state, input, stack
|
| gptkbp:describedBy |
gptkb:Chomsky_hierarchy
|
| gptkbp:hasComponent |
stack
finite state machine |
| gptkbp:hasTransitionFunction |
transition function
|
| gptkbp:hasType |
deterministic pushdown automaton
nondeterministic pushdown automaton |
| https://www.w3.org/2000/01/rdf-schema#label |
pushdown automata
|
| gptkbp:includesState |
start state
set of states accepting state |
| gptkbp:input |
input string
|
| gptkbp:introduced |
gptkb:Noam_Chomsky
|
| gptkbp:limitation |
cannot recognize all languages
limited memory (stack only) |
| gptkbp:operator |
pop
push no operation |
| gptkbp:recognizedBy |
parenthesis languages
|
| gptkbp:relatedTo |
gptkb:finite_automata
Technical Machine |
| gptkbp:usedFor |
compiler design
parsing syntax analysis |
| gptkbp:usedIn |
formal language theory
|
| gptkbp:bfsParent |
gptkb:Automata_theory
|
| gptkbp:bfsLayer |
5
|