Documents:

Homework Assignments:

• Reading Assignments are from:
  Sipser, Michael, "Introduction to the Theory of Computation", PWS Publishing Company, Boston, latest edition.

• Homework assignments will be posted here and handed out in class.

• About Homework
  • Homework should be turned in on its due date at the start of class.
  • 10% will be deducted for each late day.
  • No homework will be accepted after the graded papers and printed solutions are handed out.
  • Homework must be neat and legible.
    It should look like you cared about it.
    • It must be written out neatly on whole sheets of 8.5" by 11" paper.
    • It will not be accepted if it is scribbled between the problems on the printed assignment sheet.
    • The writing and diagrams should be large enough for me to see and read.
    • The writing and diagrams should be dark enough for me to see and read.
    • Homework should be your own work.
      It should not be copied from solutions handed out in previous years. The problems do change.
      You may talk about it with friends but you are expected to write out your own solutions.
  • If your homework does not meet these criteria, it will not be graded.

	Reading	Topics	Due Date
HW1	through page 44	Sets, Strings, DFAs	April 8, 2002
HW2	through page 58	DFAs, Closure Theorems, NFAs	April 16, 2002
HW3	Chapter 1 Palindrome Pumping Lemma sheet Chapter 2 through page 97	NFAs, Regular Expressions Pumping Lemma, Pushdown Automata, Context-Free Grammars	May 2, 2002
HW4	Chapter 3	Context-Free Grammars, Pushdown Automata	May 13, 2002
HW5	Chapters 3 & 4	Turing Machines, Decidability	May 30, 2002

Old Exams:

Useful Links: