46:49Lecture 1/65: Background: What You Probably Know
A 47-minute video from hhp3: “Lecture 1/65: Background: What You Probably Know”.
hhp3
31K subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
46:49
38:50Lecture 10/65: Equivalence of Regular Expressions and Regular Languages
A 39-minute video from hhp3: “Lecture 10/65: Equivalence of Regular Expressions and Regular Languages”.
33:08Lecture 11/65: Pumping Lemma (For Regular Languages)
A 33-minute video from hhp3: “Lecture 11/65: Pumping Lemma (For Regular Languages)”.
7:17Lecture 12/65: Regular Languages: Summary
A 7-minute video from hhp3: “Lecture 12/65: Regular Languages: Summary”.
18:59Lecture 13/65: Intro to Context Free Grammars and Languages
Intro
A 19-minute video from hhp3: “Lecture 13/65: Intro to Context Free Grammars and Languages”.
15:32Lecture 14/65: Context Free Grammar Example
A 16-minute video from hhp3: “Lecture 14/65: Context Free Grammar Example”.
15:38Lecture 15/65: Kinds of Context Free Languages
A 16-minute video from hhp3: “Lecture 15/65: Kinds of Context Free Languages”.
7:55Lecture 16/65: Facts About Context Free Languages
A 8-minute video from hhp3: “Lecture 16/65: Facts About Context Free Languages”.
15:18Lecture 17/65: Chomsky Normal Form
A 15-minute video from hhp3: “Lecture 17/65: Chomsky Normal Form”.
12:24Lecture 18/65: Chomsky Hierarchy and Context Sensitive Languages
A 12-minute video from hhp3: “Lecture 18/65: Chomsky Hierarchy and Context Sensitive Languages”.
41:32Lecture 19/65: The Pumping Lemma for CFLs
A 42-minute video from hhp3: “Lecture 19/65: The Pumping Lemma for CFLs”.
18:37Lecture 2/65: Finite State Machines: Introduction
Intro
A 19-minute video from hhp3: “Lecture 2/65: Finite State Machines: Introduction”.
18:54Lecture 20/65: PDAs: Pushdown Automata
A 19-minute video from hhp3: “Lecture 20/65: PDAs: Pushdown Automata”.
18:10Lecture 21/65: Equivalence of CFGs and PDAs (part 1)
A 18-minute video from hhp3: “Lecture 21/65: Equivalence of CFGs and PDAs (part 1)”.
26:56Lecture 22/65: Equivalence of CFGs and PDAs (part 2)
A 27-minute video from hhp3: “Lecture 22/65: Equivalence of CFGs and PDAs (part 2)”.
14:04Lecture 23/65: Introduction to Turing Machines
Intro
A 14-minute video from hhp3: “Lecture 23/65: Introduction to Turing Machines”.
11:40Lecture 24/65: Turing Machine Examples
A 12-minute video from hhp3: “Lecture 24/65: Turing Machine Examples”.
15:04Lecture 25/65: Definition of TMs and Related Language Classes
A 15-minute video from hhp3: “Lecture 25/65: Definition of TMs and Related Language Classes”.
11:46Lecture 26/65: The Church-Turing Thesis
A 12-minute video from hhp3: “Lecture 26/65: The Church-Turing Thesis”.
18:51Lecture 27/65: Turing Machine Programming Techniques
A 19-minute video from hhp3: “Lecture 27/65: Turing Machine Programming Techniques”.
8:32Lecture 28/65: Multitape Turing Machines
A 9-minute video from hhp3: “Lecture 28/65: Multitape Turing Machines”.
28:42Lecture 29/65: Nondeterminism in Turing Machines
A 29-minute video from hhp3: “Lecture 29/65: Nondeterminism in Turing Machines”.
29:33Lecture 3/65: Finite State Machines: Examples
A 30-minute video from hhp3: “Lecture 3/65: Finite State Machines: Examples”.
15:20Lecture 30/65: Turing Machines as Problem Solvers
A 15-minute video from hhp3: “Lecture 30/65: Turing Machines as Problem Solvers”.
13:00Lecture 31/65: Enumerators
A 13-minute video from hhp3: “Lecture 31/65: Enumerators”.
31:58Lecture 32/65: Decidability and Decidable Problems
A 32-minute video from hhp3: “Lecture 32/65: Decidability and Decidable Problems”.
13:45Lecture 33/65: More Decidable Problems For DFAs
A 14-minute video from hhp3: “Lecture 33/65: More Decidable Problems For DFAs”.
20:03Lecture 34/65: Problems Concerning Context-Free Languages
A 20-minute video from hhp3: “Lecture 34/65: Problems Concerning Context-Free Languages”.
11:32Lecture 35/65: The Universal Turing Machine
A 12-minute video from hhp3: “Lecture 35/65: The Universal Turing Machine”.
22:00Lecture 36/65: Infinity: Countable and Uncountable
A 22-minute video from hhp3: “Lecture 36/65: Infinity: Countable and Uncountable”.
14:36Lecture 37/65: Languages That are Not Turing Recognizable
A 15-minute video from hhp3: “Lecture 37/65: Languages That are Not Turing Recognizable”.
10:33Lecture 38/65: The Undecidability of the Halting Problem
A 11-minute video from hhp3: “Lecture 38/65: The Undecidability of the Halting Problem”.
9:25Lecture 39/65: A Language That is Not Turing Recognizable
A 9-minute video from hhp3: “Lecture 39/65: A Language That is Not Turing Recognizable”.
19:12Lecture 4/65: Operations on Regular Languages
A 19-minute video from hhp3: “Lecture 4/65: Operations on Regular Languages”.
8:45Lecture 40/65: Reducibility: A Technique for Proving Undecidability
A 9-minute video from hhp3: “Lecture 40/65: Reducibility: A Technique for Proving Undecidability”.
10:21Lecture 41/65: Halting Problem: A Proof by Reduction
A 10-minute video from hhp3: “Lecture 41/65: Halting Problem: A Proof by Reduction”.