Homework 3

Due Date: April 8, 2016

Don't forget to follow the Homework Guidelines.

  1. Do Exercise 2.6b. Explain why your grammar generates the desired language.

  2. Give the state diagram of a pushdown automata recognizing the language of Exercise 2.6b. Do not translate the grammar you obtained from the previous problem. Design your PDA from scratch.

  3. Do Problem 2.47a.

  4. Do Problem 2.47b. Use at most 3 variables and at most 7 rules.

  5. Do Exercise 2.11.

  6. (Extra credit) Give an unambiguous context-free grammar for the language { w : |w|a = |w|b }.