CS311 Computational Structures Fall 2009

• Office hour: M 1-2 in CS fishbowl
• Email: prasnita -at- cs.pdx.edu. (Please put "CS311" in the subject line.)

Final

• Reminder: final exam is Tuesday, Dec. 8 from 5:30-7:20pm in our usual classroom.
• List of topics

Midterm

• List of topics
• Suggested solutions

Prerequisite Quiz

• Quiz (pdf)
• Sample Solutions (pdf)

Lecture Notes

• Introduction 9/29/09 (pdf)
• Finite State Automata 10/01/09 (pdf)
• Nondeterministic Finite Automata 10/06/09 (pdf)
• Regular Expressions 10/13/09 (pdf)
• Properties of Regular Languages 10/15/09 (pdf)
• Context-free Languages 10/20/09 (pdf)
• Pushdown Automata 10/22/09 (pdf)
• Properties of Context-free Languages 11/5/09 (pdf)
• Turing Machines 11/10/09 (pdf) (updated 11/11/09 10:35am)
• Turing Machine Variants 11/12/09 (pdf)
• Other Models of Computation 11/17/09 (pdf)
• Decidable and Undecidable Problems 11/19/09 (pdf)
• Computational Complexity 11/24/09 (pdf) (updated 11/25/09 10:10am)
• NP-completeness 12/01/09 (pdf)

Homework Assignments and Supporting Code

• Homework 1 (due 10/6/09) (pdf) (slightly revised 10/2/09 9:25am)
  • Lbba.c
  • L2a.c
  • DFA_bba.c
  • Suggested solutions (pdf) (revised 10/29/09 10:35am)
  • LbbaU2a.c
  • DFA_bbaU2a.c
• Homework 2 (due 10/13/09) (pdf) (revised 10/12/09 8am)
  • NFA_2a2b.c
  • Suggested solutions (pdf)
• Homework 3 (due 10/20/09) (pdf)
  • NFA_2a2b.c
  • Suggested solutions (pdf) (revised 10/28/09 1:10pm)
• Homework 4 (due 10/27/09) (pdf)
  • Suggested solutions (pdf)
• Homework 5 (due 11/10/09) (pdf)
  • Suggested solutions (pdf)
• Homework 6 (due 11/17/09) (pdf)
  • Suggested solutions (pdf)
• Homework 7 (due 11/24/09) (pdf)
  • Suggested solutions (pdf)
• Homework 8 (due 12/3/09) (pdf)
  • Suggested solutions (pdf)

Textbook Resources

• The authors maintain a list of errata for Introduction to Automata Theory, Languages, and Computation, 3rd ed. Check here first if you can't make sense of something in the text.
• Answers to starred exercises.
• Portal to the Gradiance system for optional on-line homeworks.
• Additional Useful Books:
  • James Hein, Discrete Structures, Logic, and Computability , 2nd ed., Jones & Bartlett, 2002.
  • Michael Sipser, Introduction to the Theory of Computation, 2nd ed. , Thomson Course Technology, 2006.
  • Lewis and Papidimitirou, Elements of the Theory of Computation, 2nd ed., Prentice Hall, 1997.

Other Resources

• Finite Automata Simulators
  • JFLAP.
  • Jean Bovet's Visual Automata Simulator, Java downlaod.
• CS Tutors