Tue, Jun 26 
Introduction. Automata, Computability and Complexity. 
[MS05] Chapters 0,1.
 Slides: Lecture 1.

Thu, Jun 28 
Nondeterminism and Epsilon Transitions. 
[MS05] Chapter 1.
 Slides: Lecture 2.

Tue, Jul 03 
Regular Expressions and Language Properties. 
[MS05] Chapter 1.
 Slides: Lecture 3.

Thu, Jul 05 
The Pumping Lemma and Closure Properties. 
[MS05] Chapter 1.
 Slides: Lecture 4.

Tue, Jul 10 
Homomorphisms and Efficient State Minimization. 
[MS05] Chapter 1.
 Slides: Lecture 5.

Thu, Jul 12 
ContextFree Languages and Parse Trees. 
[MS05] Chapter 2.
 Slides: Lecture 6.

Tue, Jul 17 
Ambiguous Grammars and Compactification. 
[MS05] Chapter 2.
 Slides: Lecture 7.

Thu, Jul 19 
Normal Forms and Pushdown Automata. 
[MS05] Chapter 2.
 Slides: Lecture 8.

Tue, Jul 24 
Equivalence of CFG's and PDA's. 
[MS05] Chapter 2.
 Slides: Lecture 9.

Thu, Jul 26 
Midterm. 

Thu, Aug 02 
Pumping Lemma and Closure Properties of CFL's. 
[MS05] Chapter 2.
 Slides: Lecture 10.

Tue, Aug 07 
Enumerations and Turing Machines. 
[MS05] Chapter 3.
 Slides: Lecture 11.

Thu, Aug 09 
Decidability. 
[MS05] Chapter 4.
 Slides: Lecture 12.

Tue, Aug 14 
NPCompleteness and Boolean Satisfiability. 
[MS05] Chapter 5.
 Slides: Lecture 13.

Sat, Aug 18 
Final. 
