Automata Theory
Lecture Materials


Note:  Lecture notes are grouped by topic area, not the date they are given.  Each lecture topic can span several days of actual lecture time.  Notes will typically be put online after the lecture has been completed in class.

Lecture 1 - Set Theory: slides printable
Lecture 2 - Languages slides printable
Lecture 3 - Deterministic Finite Automata: slides printable
Lecture 4 - Non-Deterministic Finite Automata: slides printable
Lecture 5 - NFA vs DFA slides printable
Lecture 6 - NFA vs regular expressions: slides printable
Lecture 7 - Non-regular lagnauges / closure properties / state minimization: slides printable
Lecture 8 - Context-Free Grammars: slides printable
Lecture 9 - Push-Down Automata: slides printable
Lecture MT1R - Midterm 1 Review: slides printable
Lecture 10 - Non-Context Free Languages slides printable
Lecture 11 - Turing Machines slides printable
Lecture 12 - Turing Machine Modifications slides printable
Lecture 13 - Unrestriced Grammars slides printable
Lecture 14 - Counter Machines and Recursive Functions slides printable
Lecture MT2R Midterm 2 Review: slides printable
Lecture 15 - Undecidability slides printable
Lecture 16 - Enumeration Machines & Rice's Theorem slides printable
Lecture 17 - Complexity Theory I:  Class P slides printable
Lecture 18 - Complexity Theory II: Class NP slides printable
Lecture 19 - Dealing with NP Complete Problems slides printable
Lecture FR -Final Review slides printable