These notes are not intended to be a substitute for taking notes in class.

Date	Contents
1/17/2007	Sets and Relations
1/19/2007	Orders, Functions, Cardinality
1/22/2007	Cardinality (cont.)
1/24/2007	Induction, Closure
1/26/2007	Languages
1/29/2007	Regular Expressions, DFAs
1/31/2007	NFAs
2/2/2007	Converting NFAs to DFAs
2/5/2007	NFA -> DFA (including 1/2 of proof)
2/7/2007	Regular Expressions -> NFA
2/9/2007	NFA -> Regular Expressions
2/12/2007	Pumping Theorem
2/16/2007	Proving languages not regular using closure
2/19/2007	DFA Minimization
2/21/2007	Myhill-Nerode
2/26/2007	Exam #1 Solutions
2/28/2007	Algorithms for DFAs/NFAs
3/2/2007	Deciding WS1S via Finite Automata
3/12/2007	Context Free Grammars
3/16/2007	Parse Trees
3/19/2007	Pushdown Automata
3/23/2007	Equivalent forms of PDAs, Equivalence to CFGs
3/26/2007	Pumping Theorem, Closure for CFLs
3/28/2007	PDA → CFG
3/30/2007	Exam #2 Review
4/4/2007	LR and LL parsers (Dr. Binkley)
4/11/2007	Turing Machines
4/13/2007	Composing Turing Machines
4/16/2007	Power of Computational Models
4/18/2007	Simulating a 2-tape TM
4/20/2007	Random Access Turing Machines
4/23/2007	Nondeterministic TMs
4/25/2007	Simulating NTMs; Universal Turing Machine
4/27/2007	The Halting Problem
4/30/2007	NP-complete Problems