CS 332 - Theory of Computation

Fall 2000

An index page for various class resources

last modified 10/03/2002

GRADES ARE NOW AVAILABLE 

(see Professor Levine in person or send email)

Syllabus

Assignments

•   HW 24 - p. 169, 4.3, 4.4, 4.10, due 12/8/2000
•   Program 5 - lex due 12/4/2000
•   HW 23 - p. 168-9: 4.1, 4.2, due 12/1/2000
•   HW 22 - p. 148: 3.7, 3.8, due 11/29/2000
•   HW 21 - p. 148: 3.5 (be sure to justify your answers; simple yes/no's won't receive full credit), due 11/17/2000
•   HW 20 - Design Turing machines to accept L₁ = { (abc)ⁿ | n >= 0 } and L₂ = { aⁿbⁿcⁿ | n >= 0 }.
•   Program 4 - Turing Simulation due 11/17/2000; portion due 11/13/2000
•   HW 19 - p. 121, 2.18; p. 147, 3.1, 3.2, due 11/10/2000
•   HW 18 - pp. 120-121: 2.5, 2.9, due 10/23/2000
•   HW 17 - p. 121: 2.8, due 10/20/2000
•   HW 16 - p. 120: Put the grammar of 2.3 into Chomsky Normal Form, due 10/18/2000
•   HW 15 - pp. 119-120: 2.1, 2.3, 2.4, due 10/16/2000
•   HW 14 - p. 86: 1.17b, 1.18, due 10/13/2000
•   HW 13 - p. 86: 1.17ac, due 10/6/2000
•   HW 12 - p. 86: 1.14, 1.16, due 9/29/2000
•   HW 11 - p. 86: 1.13 due 9/25/2000
•   Program 3 - DFA Simulation due 9/27/00; portion due 9/20/00
•   HW 10 - p. 84-86: 1.7-1.9, 1.15 due 9/22/00
•   HW 9 - p. 85: 1.12  due 9/20/2000
•   HW 8 - p. 84: 1.5-1.6  due 9/18/2000
•   HW 7 - Using the machines M₁ and M₂ from exercise 1.1, create a machine that accepts L₁ U L₂ according to the construction done in class (and in the book)   due 9/15/2000
•   HW 6 - p. 84: 1.4e-n due 9/13/2000
•   HW 5 - p. 83-84: 1.1-1.3, 1.4abcd due 9/11/2000
•   HW 4 - p. 27: 0.11 due 9/8/2000
•   HW 3 - p. 27: 0.10 due 9/6/2000
•   Program 2 - A Nine Point Five?  due 9/4/2000
•   HW 2 - pp. 26-27: 0.6-0.9   due 9/4/2000
•   HW 1 - pp. 25-26: 0.1-0.5   due 9/1/2000   
•   Program 1 - Almost a Nine!  due 8/30/2000