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