CSU390 03F: Homework 05

Assigned: Wed 15 Oct 2003
Due: Fri 24 Oct 2003 (by 5pm, in my office or departmental mailbox)

Note: Please note the non-standard due date. This assignment cannot be accepted beyond Monday, Oct 27 in class as I will distribute solutions at that time in preparation for the midterm exam.

General Instructions

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

2. On the first page of each part 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: 4 of the following 6 problems
Points: 25 pts per problem

Group I

1. Construct a context-free grammar for the following language:
   {0ⁱ 1^j 2^k | i != j or j != k}

2. Exercise 2.6 (a)

3. Exercise 2.18 (a). Note: We will cover the Pumping Lemma on Monday, Oct 20; this assignment is not due until Friday, Oct 24.

4. Exercise 2.18 (b). See the above note for Problem 3.

5. Exercise 2.18 (c). See the above note for Problem 3.

6. Exercise 2.27

Switch to:

• Homework 04
• Homework 06