Catalog · Theory of Computation Lecture 4 of 25 Lecture 4: Pushdown Automata, CFG ↔ PDA ← Previous Lecture 3: Regular Pumping Lemma, Finite Automata → Regular Expressions, CFGs Next → Lecture 5: CF Pumping Lemma, Turing Machines ✓ Mark complete Materials Transcript (PDF) ↗ transcript