Definition:
A
formal language that is accepted by a [pushdown automaton]
?.
Equivalently, a formal language that can be described by a [context-free grammar]?.
Generalizations:
Specializations:
computability
- [regular language]? (accepted by a finite automaton)
Involved in:
Nothing yet
Relevant Wikipedia Articles:
the concept- context-free language
related field(s)- linguistics, theory of computation
potential real-world examples-
/Discussion
?
![[Home]](wikipedia.png)