hw07 - CS 154 Intro. to Automata and Complexity Theory...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 154 Intro. to Automata and Complexity Theory Handout 29 Autumn 2009 David Dill November 17, 2009 Problem Set 7 Due: December 1, 2009 Homework: (Total 100 points) Do the following exercises. Problem 1. [15 points] (Derived from Exercise 7.3.2 in the textbook.) Consider the following two languages: L 1 = { a n b 2 n c m | n,m 0 } L 2 = { a n b m c 2 m | n,m 0 } a) Show that each language is context-free by writing a context-free gram- mar for it. b) Show that L 1 L 2 is not context-free using closure properties and lan- guages from the lecture or textbook that are known not to be context- free (don’t use the context-free pumping lemma). Problem 2. [15 points] (From Exercise 7.4.3 (b,c) in the textbook.) Using the grammar G of Example 7.34, use the CYK algorithm to de- termine whether each of the following is in L ( G ): baaab aabab The grammar G is: S AB | BC A BA | a B CC | b C AB | a Problem 3. [15 points] (Derived from Exercise 11.1.1 in the textbook.)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/12/2010 for the course CS 154 at Stanford.

Page1 / 2

hw07 - CS 154 Intro. to Automata and Complexity Theory...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online