Podcast: link
(Video) Regular expressions introduction
(Video) Regular expressions example
(Video) Regular expressions definition recap
(Video) Regular expressions more exmaples
(Video) Regular expressions and grep
(Video) DFA first examples solution
(Video) Finite Languages are Regular
(Video) Regular Languages and Complementation
(Video) Motivation for Closure Proofs
(Video) Regular Languages and Union
(Video) DFA Design Example: Intersection
(Video) Regular Languages and Intersection
(Video) Iterated Transition Function
(Video) NFA Motivation and Definition
(Video) NFA Overview and Example
(Video) NFA Formal Definitions
(Video) Regular Languages Union Again
(Video) Regular Languages Concatenation
(Video) Regular Languages Kleene Star
(Video) DFA to Regular Expression
(Video) Regular Expression to NFA
(Video) Nonregular Sets Introduction
(Video) Nonregular Sets Strategies
(Video) Pumping Lemma and Finite Sets
(Video) Pumping Lemma Applications
(Video) Nonregular set example 1
(Video) Nonregular set example 1 proof
(Video) Nonregular set example 2 with pumping lemma
(Video) Nonregular sets summary
(Video) PDA stack implementation
(Video) PDA Design and reverse engingeering
(Video) PDA Example Nondeterminism
(Video) PDA General Constructions
(Video) CFG Design for nonregular language
(Video) Context-free languages intro
(Video) Non-context-free languages
(Video) Turing machine introduction
(Video) Turing machine definition
(Video) TM complicated example
(Video) TM Accept, Reject, Loop
(Video) TM Recognize vs Decide
(Video) TM Implementation-level and formal definition Example 1
(Video) TM Implementation-level and formal definition Example 2
(Video) TM Implementation-level and formal definition Example 3
(Video) Recognizable and Decidable languages
(Video) Regular languages are decidable
(Video) Equally expressive models
(Video) TM vs May Stay machines
(Video) High-level descriptions of TMs
(Video) Closure of class of recognizable languages under union
(Video) Decidable computational problems
(Video) ADFA and EDFA and EQDFA
(Video) AREX and ANFA are decidable
(Video) Decidability proofs recap
(Video) Undecidability Counting Argument
(Video) ATM undecidable via diagonalization
(Video) Unrecognizable languages
(Video) Undecidability proof strategies
(Video) Mapping Reduction Definition
(Video) Computable Function Definition
(Video) Computable Function First Examples
(Video) Computable Function Complicated Example
(Video) Mapping Reduction Example 1
(Video) Mapping Reduction Example 2
(Video) Mapping Reduction Example 3
(Video) Reducing A_TM to HALT_TM
(Video) Mapping Reducation Applications
(Video) Mapping Reduction Strategy
(Video) ETM is undecidable, part 1
(Video) Reduce ATM to ETM complement
(Video) Mapping reduction steps
(Video) Complexity first definitions
(Video) Complexity classes examples
(Video) Nondeterministic time complexity
(Video) Feasible vs. verifiable
(Video) Polynomial time reductions
(Video) Using polynomial time reductions