hw5 - } * | w = a n b n c n } is not context free.) Problem...

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

View Full Document Right Arrow Icon
ECS 120: Introduction to the Theory of Computation Homework 5 Problem 1. Describe the language of the following CFG grammar S aSb | bY | Y a , Y bY | aY | ± . Problem 2. Prove that the class of Context Free Languages (CFLs) are not closed under intersection and complement. (Assume you know that L = { w ∈ { a,b,c
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: } * | w = a n b n c n } is not context free.) Problem 3. Convert the following grammar into Chomsky Normal Form: A BAB | B | B 00 | . Problem 4. Prove that every Regular language is also Context Free (i.e. there exists a CFG for all L Reg ). 1...
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.

Ask a homework question - tutors are online