CS 4114, Assignment 9 The following problems may be solved using PDAs with extended transitions (see page 228). 1. Using the 2-state construction given in class, construct the PDA for the context-free grammar given in Problem 3, Pp. 98. 2. Pp. 249: 18 a and b. What is L 1 ∩ L 2 ? 3. Pp. 250: 19 a and b. What is L 1 ∩ L 2 ? 4. Show that the Pumping Lemma for CFLs is not powerful enough to show that the language
This is the end of the preview. Sign up
access the rest of the document.