0 votes 0 votes If L1 is CFL and L2 is Regular L. $L1\cap L2 = L3$ Then L3 is CFL. Can L3 be regular also sometimes and if L3 is CFL and Regular also does it employs L1 is also Regular ?? Theory of Computation theory-of-computation regular-language identify-class-language + – jatin khachane 1 asked Oct 14, 2018 jatin khachane 1 589 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Swapnil Naik commented Oct 15, 2018 i edited by Swapnil Naik Oct 15, 2018 reply Follow Share yeah true. In the first comment I was writing from the context of regular languages. i.e. assuming L1 to be regular and hence cfl. Hence the intersection will also be regular. I should have actually consider the both possibilities If L3 is regular then it can happen that L1 is cfl but not regular. 0 votes 0 votes jatin khachane 1 commented Oct 15, 2018 reply Follow Share From all this we can conclude that If property is holding in one direction it need not hold in reverse also..for all closure properties..it depend on languages 0 votes 0 votes Swapnil Naik commented Oct 15, 2018 reply Follow Share yeah, we should check all possibilities. 0 votes 0 votes Please log in or register to add a comment.
