Videos
YouTube Playlist
- COSC 312 Chapter 1 (Introduction to the Theory of Computation) - Part 1
- COSC 312 Chapter 1 (Introduction to the Theory of Computation) - Part 2
- COSC 312 Chapter 2 (Finite Automata) - Part 1
- COSC 312 Chapter 2 (Finite Automata) - Part 2
- COSC 312 Sections 3.1-3.2 (NFAs and Closure Properties)
- COSC 312 Section 3.3 (NFA to DFA Conversion, NFA/DFA Design)
- COSC 312 Section 3.3 (NFA to DFA Conversion Software Demo)
- COSC 312 Chapter 4 Introduction (Nonregular Languages)
- COSC 312 Sections 4.1 and 4.2 (Pumping Lemma for Regular Languages)
- COSC 312 Section 5.1 (Context-Free Languages: Grammars and Derivations)
- COSC 312 Section 5.2 (Chomsky Normal Form for CFGs)
- COSC 312 Chapter 6 (Pushdown Automata)
- COSC 312 Chapter 7 (Pumping Lemma for CFLs)
- COSC 312 Chapter 8 (Turning Machines) - Part 1
- COSC 312 Chapter 8 (Turing Machines) - Part 2
- COSC 312 Chapter 8 (Turing Machines) - Part 3
- COSC 312 Chapter 9 (Decidability)
- COSC 312 Chapter 10 (Halting Problem) - Part 1
- COSC 312 Chapter 10 (Halting Problem) - Part 2
- COSC 312 Chapter 11 (Reduciblity)
- COSC 312 Chapter 12 (Complexity) - Part 1
- COSC 312 Chapter 12 (Complexity) Part 2
- COSC 312 Chapter 12 (Complexity) Part 3
- COSC 312 Chapter 13 (Lambda-Calculus)