This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: of the textbook) Use the C±L pumping lemma to show that the following language is not contextfree. { a n b n c i  i ≤ n } Problem 4. [20 points] (Exercise 7.2.1(c) on page 280 of the second edition of the textbook) Use the C±L pumping lemma to show that the following language is not contextfree. { p  p is a prime } Hint : Adapt the same ideas used in Example 4.3, which showed this language not to be regular. Problem 5. [15 points] (Exercise 6.2.1(c) on page 236 of the second edition of the textbook) Design a PDA to accept the set of all strings over the alphabet Σ = { , 1 } with an equal number of 0’s and 1’s. The PDA may accept this language either by Fnal state or by empty stack, whichever is more convenient. 2...
View
Full Document
 Winter '08
 Motwani,R
 Formal language, Formal languages, Contextfree grammar, CFL, succinct description, following language

Click to edit the document details