0 votes 0 votes Let say L1 is Dcfl and L2=~L1(~ is complement L=L1 Intersection L2 What is L?? Theory of Computation theory-of-computation + – Aman Juyal asked Jan 28, 2019 Aman Juyal 515 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Deepanshu commented Jan 28, 2019 reply Follow Share dcfl is closed under complement so L2 = DCFL now both l1 and l2 are dcfl but both of them n ot closed under intersection so.... we go to check now cfl as we see is it is closed under intersection again no.... now go to CSL yeah they are closed under intersection...... so L IS CSL 0 votes 0 votes Somoshree Datta 5 commented Jan 28, 2019 reply Follow Share Here L2 is complement(L1). So shouldn't L1 $\cap$ L2 be $\phi$, and hence regular? 0 votes 0 votes Fyse commented Jan 28, 2019 i edited by Fyse Jan 28, 2019 reply Follow Share This is a wrong use of closure property. DCFL is closed under complement, which means it $\overline{DCFL}$ is always $DCFL$. DCFL is not closed under Intersection, which means the resultant language after the intersection of 2 DCFL languages may or may not be DCFL. Now in this particular example, $L_1$ is $DCFL$ and $L2 = \overline{L1}$. Hence $L2$ is also $DCFL$ Now, $L= L_1\cap L_2$ can be written as $L= L_1\cap \overline{ L_1} = \phi$ Hence L is regular and also CSL. But more correctly it is Regular. 0 votes 0 votes Deepanshu commented Jan 28, 2019 reply Follow Share yepp :) it is regular first as it is phi ..... 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes l must be csl abhishekmehta4u answered Mar 26, 2019 • edited Mar 26, 2019 by abhishekmehta4u abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.