Computer Science 423: Finite Automata and Theory of Computation

Fall 2004 web page. Here you can find all manner of information relating to CS423.

Announcements

As this class is no longer current, the solution sets have been taken down.

Contact Information

Instructor:   Moses Liskov,  mliskov@cs.wm.edu
Office:       McGl 135

TA:           Jun Wang, junwang@cs.wm.edu
Office:       McGl 101b

Lecture:      TuTh 3:30-5, McGl 020
Moses' office hours are Wednesdays, 4-5:30pm. Jun's office hours are Wednesdays, 1-2:30pm.

Handouts

  1. Course Policies (PS) - (PDF)
  2. Survey and Assesment Quiz (PS) - (PDF)
  3. Problem Set 1 (PS) - (PDF) - (LaTeX template)
  4. Problem Set 2 (PS) - (PDF) - (LaTeX template)
  5. Problem Set 3 (PS) - (PDF) - (LaTeX template)
  6. Problem Set 4 (PS) - (PDF) - (LaTeX template)
  7. Problem Set 5 (PS) - (PDF) - (LaTeX template)
  8. Problem Set 6 (PS) - (PDF) - (LaTeX template)
  9. Problem Set 7 (PS) - (PDF) - (LaTeX template)
  10. Problem Set 8 (PS) - (PDF) - (LaTeX template)

Scribe Notes

If you are having a hard time remembering when you signed up to scribe lectures, here's the scribing schedule.
  1. Lecture 1: Introduction (PS) (PDF) (TEX) by Jun Wang
  2. Lecture 2: Formally Defining Finite Automata (PS) (PDF) (TEX) by Michael Dougherty
  3. Lecture 3: Regular Expressions (PS) (PDF) (TEX) by Ed Halter
  4. Lecture 4: Regular Expressions Continued (PS) (PDF) (TEX) by Michael Dougherty
  5. Lecture 5: Non-regular Languages (PS) (PDF) (TEX) by Elizabeth Chase
  6. Lecture 6: Context-Free Grammars (PS) (PDF) (TEX) by Danny Cogut
  7. Lecture 7: Equivalence of PDAs and CFGs (PS) (PDF) (TEX) by Jun Wang
  8. Lecture 8: Non-Context-Free Languages (PS) (PDF) (TEX) by Jeremy Beker
  9. Lecture 9: Introduction to Turing Machines (PS) (PDF) (TEX) by Danny Cogut
  10. Lecture 10: Formally Defining Turing Machines (PS) (PDF) (TEX) by Ed Halter
  11. Lecture 11: Exam Review (PS) (PDF) (TEX) by Jennifer Maston
  12. Lecture 12: Variants of Turing Machines (PS) (PDF) (TEX) by Philip Shing
  13. Lecture 13: Universal Turing Machines (PS) (PDF) (TEX) by Philip Shing
  14. Lecture 14: Undecidable Languages for TMs (PS) (PDF) (TEX) by Jack Warner
  15. Lecture 15: Mapping Reductions (PS) (PDF) (TEX) by Elizabeth Chase
  16. Lecture 16: Reductions involving Computation Histories (PS) (PDF) (TEX) by Heather Combs
  17. Lecture 17: LBAs, SELF, Recursion Theorem (PS) (PDF) (TEX) by Jack Warner
  18. Lecture 18: Rice's Theorem (PS) (PDF) (TEX) by Justin Kliger
  19. Lecture 19: Exam Review (PS) (PDF) (TEX) by Justin Kliger
  20. Lecture 20: Time Complexity (PS) (PDF) (TEX) by Jun Wang
  21. Lecture 21: The Class NP and NP-Completeness (PS) (PDF) (TEX) by Jennifer Maston
  22. Lecture 22: NP Completeness (PS) (PDF) (TEX) by Justin Kliger
  23. Lecture 23: NP Completeness Examples (PS) (PDF) (TEX) by Jeremy Beker
  24. Lecture 25: Advanced NP-Completeness / Exam review (PS) (PDF) (TEX) by Jeremy Beker

Here is a list of figures for download to use with the .tex files.

  1. (fig01-01.eps)
  2. (fig02-01.eps) (fig02-02.eps) (fig02-03.eps)
  3. (fig03-01.eps) (fig03-02.eps) (fig03-03.eps) (fig03-04.eps) (fig03-05.eps) (fig03-06.eps) (fig03-07.eps)
  4. (fig04-01.eps) (fig04-02.eps) (fig04-03.eps) (fig04-04.eps) (fig04-05.eps) (fig04-06.eps) (fig04-07.eps) (fig04-08.eps) (fig04-09.eps) (fig04-10.eps)
  5. (no figures for lect05)
  6. (fig06-01.eps) (fig06-02.eps) (fig06-03.eps)
  7. (fig07-01.eps) (fig07-02.eps) (fig07-03.eps) (fig07-04.eps)
  8. (fig08-01.eps) (fig08-02.eps) (fig08-03.eps) (fig08-04.eps) (fig08-05.eps)
  9. (fig09-01.eps) (fig09-02.eps) (fig09-03.eps)
  10. (fig10-01.eps)