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
3:53:22
Regular Languages in 4 Hours (DFA, NFA, Regex, Pumping Lemma, all conversions)
30:03
Pumping Lemma for Context-Free Languages, Statement and FULL PROOF
1:09:23
4. Pushdown Automata, Conversion of CFG to PDA and Reverse Conversion
2:49:40
Turing Machines + Decidability in 3 Hours (TM, Variants, Church-Turing, Decidability)
19:03
Context-Free Grammars (CFGs): 5 Easy Examples
21:41
Chomsky Normal Form (CNF) Conversion Example
48:49