Context-Free Languages in 3.5 Hours (CFG, PDA, Conversions, Closure, Pumping Lemma)
34:19
How I Make Theory of Computation Exams #1 (Regular Languages) - Easy Theory
48:49
Pumping Lemma for Context-Free Languages: Four Examples
3:53:22
Regular Languages in 4 Hours (DFA, NFA, Regex, Pumping Lemma, all conversions)
24:21
Context Free Grammar to Pushdown Automaton Conversion (CFG to PDA)
30:03
Pumping Lemma for Context-Free Languages, Statement and FULL PROOF
18:57
Context-Free Grammars (CFGs): 5 Intermediate Examples
26:28
Final exam explained and preparation activity
2:21:21