CS 3613: Theoretical Foundations of Computing
Spring 2009
Homework 5: Non-Regularity and Context-Freedom
Due Date: March 26, 2009
----------------------------------------------------

Notes:

• Read Course Information: Section 7 (Miscellaneous) and Section 9 (Academic Dishonesty or Misconduct).
  
  
• When you are giving a construction, example, etc., provide a justification with your argument. Your solutions to numerical problems must contain the derivation of your answers. In all of your presentations, strive for correctness, completeness, and clarity. When in doubt about the assumptions of problems, the interpretations of wording, etc., consult the instructor.
  
  
• You should strive to complete all problems assigned, and a subset of them will be graded.
  
  

1. Read the notes above carefully.
   
   
2. Do [Sip06] Chapter 1, problems 1.35, 1.46 (c) and (d), 1.47, and 1.54.
   
   
3. Do [Sip06] Chapter 2, exercises 2.2, 2.6 (b) and (d), 2.13, and 2.15, and problem 2.19 For each context-free grammar constructed, briefly and precisely characterize the strings generated by each variable in the grammar.
   
   

---

File translated from T_EX by T_TH, version 3.35.
On 9 Mar 2009, 14:27.