This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 3. (25 points) Show that the following language L 1 is not context free: } such that 1 and * } 1 , {  { 2 1 m n w w w L n m = = ∈ = 4. (25 points) Consider two languages CFL L ∈ 2 and REG L ∈ 3 . Explain your answers to the questions below: a) Is the language 3 2 L L − necessarily in CFL ? ( 3 2 L L − is the set of strings in L 2 with those in L 3 removed.) b) Is the language 2 3 L L − necessarily in CFL ?...
View
Full
Document
This note was uploaded on 02/13/2012 for the course CS 91.304 taught by Professor Staff during the Fall '11 term at UMass Lowell.
 Fall '11
 Staff
 Computer Science

Click to edit the document details