0 votes 0 votes Is this given answer correct? Theory of Computation theory-of-computation + – Avik Chowdhury asked Aug 7, 2018 edited Aug 7, 2018 by Avik Chowdhury Avik Chowdhury 368 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Shaik Masthan commented Aug 7, 2018 reply Follow Share yes, given answer is correct, R' ∩ C' = ( R U C )' = C' ===> is it CFL closed under complementation? No ===> Is it CSL closed under Complementation? yes therefore it must be CSL but it may or may not CFL When CFL is DCFL then it is closed under complementation 1 votes 1 votes Manas Mishra commented Sep 14, 2018 reply Follow Share R is regular so complement(R) is also regular as regular language are closed under complementation . C is cfl so complement (C) is necessarily not cfl as cfl are not closed under complementation bt its is necessarily csl becoz cfl is subset of csl. so intersection of csl and regular is definitely csl .(becoz regular are also csl and csl ∩ csl = csl as csl are closed under intersection).... 0 votes 0 votes Please log in or register to add a comment.
Best answer 0 votes 0 votes L1=regular so L1(complement) is also regular as well as CFL. L2=CFL so its complement will be CSL .now $L1\bigcap L2$ will be CSL not CFL BASANT KUMAR answered Aug 7, 2018 selected Aug 7, 2018 by Avik Chowdhury BASANT KUMAR comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Aug 7, 2018 reply Follow Share it may be CFL 0 votes 0 votes Please log in or register to add a comment.