304_HW4_F11 - (15 points Chomsky Normal Form for...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Foundations 91.304 (section 201) Fall, 2011 1 Homework Set #4 Assigned: Monday, 10/3 Due: Monday, 10/17 (start of lecture) This assignment covers textbook material in Chapter 2.1-2.2. Note: Refer to course web site for homework policies. Remember to attach signed honor statement. 1. (15 points) Context-Free Grammars : Provide a derivation of the string yxxyyy in the grammar with 4-tuple ) , , , ( S R V Σ , where } , { Z S V = , } , { y x = Σ , and } , | | { SS Z yZy xZx S R = ε 2. (25 points) Context-Free Grammars : Give a CFG for the following language (provide the 4- tuple): } 2 for and * } , { | { n m y x w y x w w n m = 3.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (15 points) Chomsky Normal Form for Context-Free Grammars : Convert your grammar from Problem (2) into Chomsky normal form. Show the steps of the proof of Theorem 2.9 in this case, as shown in Example 2.10 on p. 108-109. 4. (20 points) Pushdown Automata : Design a PDA for the CFG in Exercise 2.3 on p. 128 using the procedure given in Lemma 2.21. Provide the 6-tuple. 5. (25 points) Pushdown Automata : Design a PDA for the following language: }*} , { and and * } , , { | { R f d v vev w f e d w w ∈ = ∈ Provide the 6-tuple....
View Full Document

This note was uploaded on 02/13/2012 for the course CS 91.304 taught by Professor Staff during the Fall '11 term at UMass Lowell.

Ask a homework question - tutors are online