Section	Recommended Exercises (not to be collected)	Collected Homework Assignments (Problem numbers are from Linz, 6th ed.)
1.1	1-8, 12, 14, 16, 20, 26, 30, 39, 41, 43 Note: "1-8" means 1 through 8 inclusive	HW #1 - due Fri. 2/3 1.1: 1-4, 17  HW #2 - due Wed. 2/8 1.1: 21, 28, 36, 42, 44
1.2	1, 2, 6, 8, 11, 13, 14af, 17af, 18a, 21, 24	HW #3 - due Mon. 2/13 1.2: 9, 12, 17abeh, 18bc
2.1	2, 3c, 4a, 7a, 8a, 11abc, 12, 16, 19, 22	HW #4 - due Mon. 2/20 2.1: 4bcd, 5abcd 2.2: 7, 8
2.2	3-6, 9-17
2.3	1-11 odd	HW #5 - due Thu. 2/23 2.3: 2, 4
2.4	1,2,3 (5th. ed. 1,2,4)
3.1	1-13 odd, 16, 19	HW #6 - due Wed. 3/8 3.1: 4, 8, 18, 20
3.2	1-5, 6a, 7a, 10, 11	HW #7 - due Mon. 3/13 3.2: 6bc, 12ab 3.3: 2, 6, 14cd
3.3	1, 3, 4, 7, 12
4.1	1a, 2, 4, 9, 11, 14, 16, 17, 22	HW #8 - due Fri. 3/17 4.1: 10, 12, 21 4.2: 5, 12
4.2	1-4, 7-10, 13, 17
4.3	1, 3, 5af, 6ab, 7a	HW #9 - due Wed. 3/29 4.3: 2, 4, 5e (Hint: note that the language in #5e is the complement of the language in #4)
5.1	1-4, 9-12, 15
5.2	2, 4-8, 13, 15, 17, 19
6.1	1-11, 15	HW #10 - due Fri. 4/14 Click here
6.2	1-6, 10-13
6.3	1-4
7.1	1-13
7.2	1-8
9.1	1-10
9.2	See the "Combining Turing machines" handout
10.1	1-9
10.2	3 (and Describe (verbally, no diagrams needed) how we could use a multihead Turing machine (as in 10.2 #3) to accept the language anbncn.)
10.4	1-10
11.1	2, 5-9, 12, 16-19
12.2	Practice Exercises from Section 12.2 handout: Undecidability and Rice's Theorem