CSCI 2670, Fall 2012
Introduction to Theory of Computing
Homework Assignment 4
Due Thursday October 11, 2012
(Unless otherwise specified, questions are selected from the textbook Michael Sipser, Introduction to the Theory of Computation, Second Edition, Thomson Course Technology.)
- Exercise: question 2.3, page 128. Answers are on page 1.32. You do not need to turn answers for this exercise.
- Question 2.1 (c), page 128.
- Question 2.1 (d), page 128.
- Give a grammar that can generate the following language
L = { w : w begins with a 1 and ends with a 0} over the alphabet {0, 1}.
- Question 2.4 (c), page 128.
- Question 2.4 (e), page 128.
- Convert the grammar in question 2.1 to Chomsky normal form. Note that variables are {E, T, F}, terminals are {+, x , (, ), a}, and the start variable is E.