ConceptTheory & Algos
Equivalence of CFGs and PDAs
A language is context-free if and only if some pushdown automaton recognizes it, meaning the class of context-free languages is identical to the class of languages recognized by pushdown automata.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.