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.
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
 Winter '10
 n
 Formal language, Formal languages, Regular expression, Regular language, Kleene star, CFL

Click to edit the document details