R. E. Newman, University of Florida
Last modified 2004.08.31
Schedule (Planned)
- Week 1 (8/24-26)- Chapters 0 and 1: Regular Languages,
Regular Expressions, FSAs, NFSAs; Homework 1
- Week 2 (8/31-9/2)- Chapter 1: GNFAs, Pumping Lemma for RLs; Homework 2
- Week 3 (9/7-9)- Chapter 2: FGs, CFLs, RGs, derivations, trees, ambiguity,
PDAs - out of town Thursday 9/9 - pretape; Homework 3
- Week 4 (9/14-16)- Chapter 2: FGs, CFLs, PDAs, Review
- EXAM 1 (Ch. 0-2) 9/21
- Week 5 (9/23)- review exam 1.
- Week 6 (9/28-30)- Chapter 3: Turing Machines; Homework 4
- Week 7 (10/5-7)- Chapter 4: Decidability, Reducibiilty; Homework 5
- Week 8 (10/12-14)- Chapter 5: Decidability, Reducibiilty; Homework 6
- Week 9 (10/19-21)- Chapter 6: Recursion Theorem; REVIEW;
- EXAM 2 (Ch. 3-5) 10/26
- Week 10 (10/28)- Review exam 2.
- Week 11 (11/4)- Chapters 7: NP Completeness; Homework 7
- Week 12 (11/9)- Chapters 7: NP Completeness; Homework 8
- Week 13 (11/16-18)- Chapter 8: PSPACE; Homework 9
- Week 14 (11/23)- Chapters 8, 9: PSPACE; Time Hierarchy
- Week 15 (11/30-12/2)- REVIEW
- Week 16 (12/7)- EXAM 3 (Ch.7-9)
This document is
copyright 2004
by Richard E. Newman.
Send comments to nemo@cise.ufl.edu