0 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 608 views answer comment Share Follow Print See all 4 Comments 4 4 Comments reply Anjan commented Nov 15, 2017 reply Follow flag OPTION C 0 0 replyShare Rupendra Choudhary commented Nov 16, 2017 reply Follow flag L=L1.L2 ∩ (L3)' // csl.csl=csl , (cfl)' is at least csl csl ∩ csl =csl 1 1 replyShare aaru14 commented Nov 16, 2017 reply Follow flag answr is recusive... 0 0 replyShare Rupendra Choudhary commented Nov 16, 2017 reply Follow flag 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 2 replyShare Please log in or register to add a comment.
