CMPS 364 (Theory of Computation)   Fall 2009

Test Information

• Final Exam
• Sample Solutions

Homework Assignments

• HW #1: Countably Infinite Sets
• HW #2: Induction and DFAs
• HW #3: NFAs, DFAs, Regular Languages, and the Pumping Lemma
• HW #4: More Regular Languages, etc.
• HW #5: Regular Languages and Context-Free Grammars
• HW #6: More Context-Free Grammars
• HW #7: Yet More Context-Free Languages

Online Handouts

• Solution to HU's Exercise 1.4