CS3800 10F: Homework 02

Assigned: Wed 22 Sep 2010
Due: Wed 29 Sep 2010

Instructions

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

   Problem	01	02	03	04	05	06	07	08	09	...
   Credit	RC	RC	RC	EC	RC	RC	NA	RC	RC	...

   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.

Problems

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

1. Use the construction given in the proof of Theorem 1.47 to give the state diagrams of the NFA recognizing the concatenation of the languages recognized by M_1 and M_2 in Exercise 1.1.
   Use the construction given in the proof of Theorem 1.49 to give the state diagrams of the NFA recognizing the star of the language recognized by M_2 in Exercise 1.1.
2. Exercise 1.7, parts b, c, d.
3. Exercise 1.7, parts e, g, h.
4. Exercise 1.16.
5. Exercise 1.17.
6. Exercise 1.18, parts a, b, c, d, e, f, g.
7. Exercise 1.18, parts h, i, j, k, l, m, n.
8. Exercise 1.22.