CS3800 10F: Homework 06

Assigned: Wed 11-3
Due: Wed 11-10


  1. Please review the grading policy outlined in the course information page.

  2. On the first page of your solution write-up, you must make explicit which problems are to be graded for "regular credit", which problems are to be graded for "extra credit", and which problems you did not attempt. Please use a table something like the following

    Problem01020304 0506070809...

    where "RC" is "regular credit", "EC" is "extra credit", and "NA" is "not applicable" (not attempted). Failure to do so will result in an arbitrary set of problems being graded for regular credit, no problems being graded for extra credit, and a five percent penalty assessment.

  3. You must also write down with whom you worked on the assignment. If this changes from problem to problem, then you should write down this information separately with each problem.


Required: 6 of the following 8 problems
Points: 20 pts per problem

  1. Exercise 3.4.
  2. Exercise 3.8 part b. Note: You do not have to specify the state diagram, rather you have to "use English prose to describe the way the Turing machine moves its head and the way that it stores data on its tape." (Sipser page 157)
  3. Problem 3.9.
  4. Problem 3.15. Parts b-e. Note: part a is already solved, and you can use it in your proofs.
  5. Problem *3.18.
  6. Exercise 4.3.
  7. Exercise 4.6.
  8. Exercise 4.7.