|
Definition: A formal language that is accepted by a pushdown automaton[?].
Equivalently, a formal language that can be described by a context-free grammar[?].
computability
Involved in: Nothing yet
related field(s)- linguistics, theory of computation
potential real-world examples-
Search Encyclopedia
|
Featured Article
|