Homework is due at the beginning of class on the specified date.
| Homework | Due Date | Reading | Assignment |
|---|---|---|---|
| 1 | 1/29/2007 | 1.1-1.7 | pp. 8-9: 1.1.1, 1.1.2ad, 1.1.4; p. 13: 1.2.1a; pp. 18-20 1.3.2, 1.3.6ac; p. 23: 1.4.2ab; p. 29: 1.5.8; p. 41: 1.6.1ab; p. 46:1.7.4c, 1.7.5 |
| 2 | 2/5/2007 | 1.8-2.2 | pp. 51-2: 1.8.1,1.8.2bc,1.8.3b,1.8.4 (Hard); p. 60: 2.1.1, 2.1.2, 2.1.3ae, 2.1.7; pp. 73-5: 2.2.1b, 2.2.6, 2.2.9. |
| 3 | 2/16/2007 | 2.3-2.4 | pp. 83-86: 2.3.3, 2.3.4a, 2.3.6bc, 2.3.7bd; pp. 89-92: 2.4.3b, 2.4.4, |
| 4 | 2/21/2007 | 2.4-2.5 | pp. 89-92: 2.4.5bc, 2.4.8acd; pp. 100-102: 2.5.1aii-iii, 2.5.2, 2.5.3 (only for 2.1.2 top right and 2.2.9 machine a) |
| Exam #1 Practice | 2/21/2007 (not to hand in) | Chs. 1,2 | Problems and Solutions |
| 5 | 3/14/2007 | 2.6 | pp. 109-110: 2.6.1, 2.6.2ac; Show that N is not finite by showing that the corresponding sentence &exist X &forall y, y &isin X in L(WS1S) is false by constructing the automaton for y &isin X and eliminating quantifiers. |
| 6 | 3/21/2007 | 3.1-3.3 | pp. 120-122: 3.1.1, 3.1.3ac, 3.1.4, 3.1.7, 3.1.9ab; pp. 129: 3.2.3, 3.2.4; pp. 135-136: 3.3.1, 3.3.2b |
| 7 | 3/28/2007 | 3.3-3.5 | pp. 135-136: 3.3.4a; pp. 142-143: 3.4.1, 3.4.3, 3.4.4; pp. 148-150: 3.5.1ab, 3.5.2cd, 3.5.9, 3.5.14ad |
| Exam #2 Practice | 3/30/2007 (not to hand in) | Ch. 3 | Problems and Solutions |
| 8 | 4/18/2007 | 4.1-4.2 | pp. 191-194: 4.1.1, 4.1.4, 4.1.7, 4.1.10; p. 200: 4.2.1, 4.2.2ad, 4.2.4 |
| 9 | 4/25/2007 | 4.3-4.6 | p. 209: 4.3.3, 4.3.4; p. 221: 4.4.2, 4.4.4; p. 226-227: 4.5.2; pp. 232-233: 4.6.2ab |