0 votes 0 votes if L1 and L2 are two context sensitive language and L3 is a context free then L=L1.L2-L3 is a)regular b)context free c)context sensitive d)recursive language Theory of Computation theory-of-computation + – aaru14 asked Nov 15, 2017 aaru14 290 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Anjan commented Nov 15, 2017 reply Follow Share OPTION C 0 votes 0 votes Rupendra Choudhary commented Nov 16, 2017 reply Follow Share L=L1.L2 ∩ (L3)' // csl.csl=csl , (cfl)' is at least csl csl ∩ csl =csl 1 votes 1 votes aaru14 commented Nov 16, 2017 reply Follow Share answr is recusive... 0 votes 0 votes Rupendra Choudhary commented Nov 16, 2017 reply Follow Share the output language is at least CSL so recursive too. C and D both are answers. if answer is given only D then that's wrong answer. 2 votes 2 votes Please log in or register to add a comment.
