Module #0 Background, Motivation and Applications
Module #1 Basic Definitions
Module #2 Context-Free Grammars and Languages
Module #3 Automata (DFA's and NFA's)
Module #4 Properties of Regular languages
Module #5 Properties of Context-Free Languages
Module #6 Automata (PDA's)
Module #7 Turing Machines and Computability
Module #8 Decidability (Revisited) and Undecidability
Module #9 Tractable, Intractable, and NP-Complete Problems