Statements (35)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
Technical Machine
Computational model |
| gptkbp:allows |
Context-free language
|
| gptkbp:describedBy |
Input alphabet
Start state Transition function Initial stack symbol Set of accepting states Set of states Stack alphabet |
| gptkbp:formalDefinition |
7-tuple (Q, Σ, Γ, δ, q0, Z0, F)
|
| gptkbp:hasComponent |
Stack
Finite state machine |
| gptkbp:hasProperty |
Can perform push and pop operations
Memory is stack-based Reads input string Transitions depend on input symbol and stack symbol |
| gptkbp:hasType |
Deterministic pushdown automaton
Nondeterministic pushdown automaton |
| https://www.w3.org/2000/01/rdf-schema#label |
Pushdown automaton
|
| gptkbp:introduced |
gptkb:Noam_Chomsky
|
| gptkbp:introducedIn |
1960s
|
| gptkbp:limitation |
Cannot recognize all context-sensitive languages
Cannot recognize all regular languages deterministically |
| gptkbp:relatedTo |
Technical Machine
Finite automaton |
| gptkbp:usedFor |
Parsing
Syntax analysis Compiler design |
| gptkbp:usedIn |
gptkb:Formal_language_theory
|
| gptkbp:bfsParent |
gptkb:Nondeterministic_finite_automaton
gptkb:Deterministic_Finite_Automaton gptkb:Context-Free_Grammar gptkb:Context-free_grammar |
| gptkbp:bfsLayer |
7
|