{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

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

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

{[ snackBarMessage ]}

Ask a homework question - tutors are online