test2 - 3. Problem 2.14 4. Prove that the Kleene closure of...

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

View Full Document Right Arrow Icon
1. Prove that the language L = {w | w=vuu^R, for u,v in Sigma^*} is a CFL by constructing a CFG and a PDA. 2. Prove that the intersection of a CFL and a regular language is a CFL.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 3. Problem 2.14 4. Prove that the Kleene closure of a CFL is a CFL. 5. Problem 2.45...
View Full Document

This note was uploaded on 12/11/2010 for the course CSE CSE 2001 taught by Professor N during the Winter '10 term at York University.

Ask a homework question - tutors are online