Please state any assumptions you make very clearly. Answer the questions in your own words. You must do the homework individually.

Link up to the course web page

It has been brought to my attention after the TA's grading the homeworks that some of you are using different editions of the book (or perhaps the "same" 2nd edtion has different exercises / problems). If you think that is the case, you should copy the question from the book before answering it. That will let the TA know what he is grading. But please, please, try to get the correct 2nd edition of the book, that will simplify the workload on the TA, so he does not have to grade unique problems for each student!
Link to i301 web page where Min posts copies of the homework questions for the benefit of those students who have a different version of the textbook

1. Build a boolean summary table of closure results, based on Chapters 0-3, as follows. Row headers are operators:
   • union
   • intersection
   • concatenation
   • complement
   • star
   Column headers are languages:
   • regular
   • context-free
   • Turing-decidable
   • Turing-enumerable
2. Exercise 4.2
3. Exercise 4.3
4. Exercise 4.4
5. Exercise 4.6
6. Exercise 4.7
7. Problem 4.10
8. Problem 4.12
9. Problem 4.15
10. Problem 4.16

1. Exercise 3.4
2. Exercise 3.6
3. Exercise 4.1
4. Problem 4.9
5. Problem 4.11
6. Problem 4.13
7. Problem 4.22