This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: say why this does not contradict the Pumping Lemma. Problem 4. Sipser, Exercise 2.4. 1 Problem 5. Exhibit a context free grammar for the language L = { a n b m : n 6 = 2 m } . Then describe a PDA for the same language. You do not need to be formal about the PDA; explaining how it behaves in English is ﬁne. Problem 6. Consider the grammar G deﬁned by S → AA , A → AAA  bA  Ab  a . (a) Carefully and precisely describe the L ( G ) in an easytorecognize form. (b) Is L ( G ) regular? Prove your answer either way. (c) Is G ambiguous? Prove your answer either way. (d) Is L ( G ) inherently ambiguous? Give a convincing argument either way. Problem 7 Sipser, Page 129, Exercise 2.6, b), d). 2...
View
Full
Document
This note was uploaded on 04/29/2010 for the course ECS 222 taught by Professor Mr. during the Spring '10 term at UC Davis.
 Spring '10
 mr.

Click to edit the document details