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