1:17:38(CS4510 Automata and Complexity) 1-1 Introduction, DFAs and NFAs
A 78-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 1-1 Introduction, DFAs and NFAs”.
Abrahim Ladha
856 subscribers on YouTube
Shorts, livestreams, trailers and promos are never listed. Unless a curator approved this channel in full, only individually picked videos appear.
1:17:38
42:42(CS4510 Automata and Complexity) 1-2 Closure & Regular Expressions
A 43-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 1-2 Closure & Regular Expressions”.
19:16(CS4510 Automata and Complexity) 10-1 Rice's Theorem
A 19-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 10-1 Rice's Theorem”.
22:21(CS4510 Automata and Complexity) 10-2 The Recursion Theorem
A 22-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 10-2 The Recursion Theorem”.
46:47(CS4510 Automata and Complexity) 11-1 Godel Incompleteness
A 47-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 11-1 Godel Incompleteness”.
35:34(CS4510 Automata and Complexity) 11-2 Busy Beavers & Kolmogorov Complexity
A 36-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 11-2 Busy Beavers & Kolmogorov Complexity”.
27:14(CS4510 Automata and Complexity) 12-1 Introduction to Complexity
A 27-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 12-1 Introduction to Complexity”.
22:00(CS4510 Automata and Complexity) 12-2 Time Complexity
A 22-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 12-2 Time Complexity”.
29:43(CS4510 Automata and Complexity) 13-1 The Cook-Levin Theorem
A 30-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 13-1 The Cook-Levin Theorem”.
54:01(CS4510 Automata and Complexity) 13-2 Some NP-complete Problems
A 54-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 13-2 Some NP-complete Problems”.
55:42(CS4510 Automata and Complexity) 2-1 Regexes are Regular, and the Pumping Lemma
A 56-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 2-1 Regexes are Regular, and the Pumping Lemma”.
19:10(CS4510 Automata and Complexity) 2-2 The Myhill-Nerode Theorem
A 19-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 2-2 The Myhill-Nerode Theorem”.
48:28(CS4510 Automata and Complexity) 3-1 Regular and Context-Free Grammars
A 48-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 3-1 Regular and Context-Free Grammars”.
26:01(CS4510 Automata and Complexity) 3-2 Chomsky Normal Form
A 26-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 3-2 Chomsky Normal Form”.
44:32(CS4510 Automata and Complexity) 4-1 Pumping Lemma for CFLs & Closure
A 45-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 4-1 Pumping Lemma for CFLs & Closure”.
1:01:34(CS4510 Automata and Complexity) 4-2 Push Down Automata
A 62-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 4-2 Push Down Automata”.
22:54(CS4510 Automata and Complexity) 5-1 Each CFG has a PDA
A 23-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 5-1 Each CFG has a PDA”.
34:31(CS4510 Automata and Complexity) 5-2 Turing Machines
A 35-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 5-2 Turing Machines”.
30:13(CS4510 Automata and Complexity) 6-1 Church-Turing Thesis
A 30-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 6-1 Church-Turing Thesis”.
40:23(CS4510 Automata and Complexity) 6-2 Turing-Completeness
A 40-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 6-2 Turing-Completeness”.
53:33(CS4510 Automata and Complexity) 7-1 Diagonalization
A 54-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 7-1 Diagonalization”.
29:09(CS4510 Automata and Complexity) 7-2 The Halting Problem
A 29-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 7-2 The Halting Problem”.
28:02(CS4510 Automata and Complexity) 8-1 Some Decidable Problems
A 28-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 8-1 Some Decidable Problems”.
23:42(CS4510 Automata and Complexity) 8-2 Reductions
A 24-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 8-2 Reductions”.
40:54(CS4510 Automata and Complexity) 9-1 Context Sensitive Languages & Computation Histories
A 41-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 9-1 Context Sensitive Languages & Computation Histories”.
25:15(CS4510 Automata and Complexity) 9-2 Post Correspondence Problem
A 25-minute video from Abrahim Ladha: “(CS4510 Automata and Complexity) 9-2 Post Correspondence Problem”.
1:10:58CS 3510 L4 Cryptography
A 71-minute video from Abrahim Ladha: “CS 3510 L4 Cryptography”.
1:14:25CS 3510 L5 Depth First Search (NO AUDIO)
A 74-minute video from Abrahim Ladha: “CS 3510 L5 Depth First Search (NO AUDIO)”.
59:40CS2050 L1 Introduction, Why Logic?
A 60-minute video from Abrahim Ladha: “CS2050 L1 Introduction, Why Logic?”.
38:48CS2050 L10 More Set Theory
A 39-minute video from Abrahim Ladha: “CS2050 L10 More Set Theory”.
52:25CS2050 L11 Functions
A 52-minute video from Abrahim Ladha: “CS2050 L11 Functions”.
52:55CS2050 L12 Big O Notation
A 53-minute video from Abrahim Ladha: “CS2050 L12 Big O Notation”.
24:41CS2050 L13 Basis Representation Theorem
A 25-minute video from Abrahim Ladha: “CS2050 L13 Basis Representation Theorem”.
49:58CS2050 L14 Elementary Number Theory
A 50-minute video from Abrahim Ladha: “CS2050 L14 Elementary Number Theory”.
40:58CS2050 L15 GCD and LCM
A 41-minute video from Abrahim Ladha: “CS2050 L15 GCD and LCM”.
1:07:19CS2050 L16 Bezout's Identity and Group Theory
A 67-minute video from Abrahim Ladha: “CS2050 L16 Bezout's Identity and Group Theory”.