Homework is due at the beginning of class on the specified date.

Homework	Due Date	Reading	Assignment
1	1/26/2005	1.1-1.5	pp. 8-9: 1.1.1, 1.1.2ad, 1.1.3a, 1.1.4; p. 13: 1.2.1a; pp. 18-20 1.3.2a, 1.3.6ac, 1.3.8
2	1/31/2005	1.6-2.1	pp. 29: 1.5.7; p. 41: 1.6.7; p. 46: 1.7.4c, 1.7.5; pp. 51-2: 1.8.1, 1.8.2bd, 1.8.3a, 1.8.4, 1.8.5; pp. 60-3: 2.1.1, 2.1.3ab, 2.1.7
3	2/7/2005	2.1-2.2	pp. 60-3: 2.1.1, 2.1.3ab, 2.1.7; pp. 73-5: 2.2.1, 2.2.2, 2.2.3d, 2.2.4b, 2.2.9, 2.2.10
4	2/14/2005	2.3-2.4	pp. 83-6: 2.3.1, 2.3.3, 2.3.4ac, 2.3.6a
5	2/21/2005	2.4-2.6	pp. 89-92: 2.4.3abd, 2.4.5a, 2.4.6, 2.4.8acd
6	2/28/2005	2.5-2.6	pp. 100-2: 2.5.1.ii (parts a and b), 2.5.3 (minimize the automata from 2.1.2; if already minimal just say so instead of redrawing the machine); pp. 109-10: 2.6.1, 2.6.2; Write detailed pseudocode for an algorithm that, given two minimal DFAs as input, determines if they are equivalent.
Midterm Practice	3/2/2005 (not to hand in)	Chs. 1,2	html
7	3/21/2005	3.1-3.3	pp. 120-2: 3.1.2, 3.1.3, 3.1.9bf; pp. 129-30: 3.2.2, 3.2.4b; pp. 135-6: 3.3.1, 3.3.2d
8	4/11/2005	3.5-3.6	pp. 148-50: 3.5.1ab, 3.5.2bd, 3.5.15 (Hint: for (a) write - in terms of intersection and complement and for (b) think about trivial cases); pp. 157: 3.6.1
9	4/25/2005	4.1-4.5	pp. 191-4: 4.1.1, 4.1.7, 4.1.10; p. 200: 4.2.2d; p. 209: 4.3.3; p. 221: 4.4.2; p. 227: 4.5.2
Final Exam Practice	5/2/2005 (not to hand in)	Chs. 1-5	html (and solutions)