Assignment 0, due September 30, 2004
All problems are from Sipser:
- Sipser 0.1 d,e,f
- 0.2 d,e,f
- 0.3 f
- 0.6 e
- 0.7
- 0.8
Assignment 1, due October 5, 2004
- 0.10
- 0.11
- 1.3
- 1.4 h,k,l,m,n
- 1.11
- 1.24
Assignment 2, due October 12, 2004
- Sipser 1.12 b
- 1.16 a
- 1.17 a
- 1.34
- 1.35
Assignment 3, due October 19, 2004 (revised due October 21, 2004)
- Sipser 2.2
- 2.17 a,b
- 2.18 a,b
- 2.20
- 2.26 [If this problem is assigned in the future a hint should be given.]
Assignment 4, due October 28, 2004
- Sipser 3.6
- 3.16 [Hint: Do exercise 3.6 first. To solve this problem you must construct an in-order enumerator from a decider and a decider from an in-order enumerator. I recommend doing explicit constructions for both directions. The construction of the in-order enumerator can fail if the machine is not a decider. If you find it helps you may assume that the language is infinite.]
- 4.7
- 4.11
- 4.18
Midterm Exam
The midterm exam is downloadable here. It is a pdf file.
Assignment 5, due November 23, 2004 (postponed to November 30, 2004)
Assignment 5 is downloadable here. It is a pdf file. There are some hints available here. Partial solution here.
Assignment 6, due November 30, 2004
Download here.
|
|