4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
1:13:59
5. CF Pumping Lemma, Turing Machines
1:00:34
1. Introduction, Finite Automata, Regular Expressions
24:21
Context Free Grammar to Pushdown Automaton Conversion (CFG to PDA)
1:03:27
2. Nondeterminism, Closure Properties, Conversion of Regular Expressions to FA
22:49
Equivalence of CFG and PDA (Part 1)
1:10:02
3. Regular Pumping Lemma, Conversion of FA to Regular Expressions
1:14:49
6. TM Variants, Church-Turing Thesis
19:03