38 votes 38 votes Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ is always regular never regular always a deterministic context-free language always a context-free language Theory of Computation gateit-2006 theory-of-computation closure-property easy + – Ishrat Jahan asked Oct 31, 2014 • edited Jan 28, 2018 by kenzou Ishrat Jahan 9.9k views answer comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments Sagar78 commented May 16, 2020 reply Follow Share Weather option D is NON DETERMINISTIC CFL? ?? 0 votes 0 votes Sanandan commented Oct 6, 2020 reply Follow Share option D is the correct option. 0 votes 0 votes Aadesh commented Oct 9, 2020 1 flag: ✌ Low quality (PreyumKr) reply Follow Share @Sagar78 as it is written CFL we have to consider for both DCFL and NCFL(non-deterministic). 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Answer: D Rajarshi Sarkar answered Apr 11, 2015 Rajarshi Sarkar comment Share Follow See all 2 Comments See all 2 2 Comments reply Harsh Gupta commented Aug 17, 2017 reply Follow Share I have a doubt what if we take regular language as empty set { } or phi then if we take common between CFL and regular language which is empty set then it will give empty set as final answer which regular language. So answer can be regular language also. 2 votes 2 votes smsubham commented Oct 25, 2017 reply Follow Share @harsh RL is a subset of CFL. Moreover, in options, we have always RL and never RL, not sometimes RL. So the only D is correct. 2 votes 2 votes Please log in or register to add a comment.
1 votes 1 votes https://cs.stackexchange.com/questions/18642/intersection-of-context-free-with-regular-languages The above link contains a very well written answer to your question with a neat and easy to understand explanation. Hope it helps ! :) jaideeppyne answered Dec 9, 2017 jaideeppyne comment Share Follow See all 2 Comments See all 2 2 Comments reply air1ankit commented Dec 9, 2017 i edited by Arjun Jul 11, 2022 reply Follow Share Intersection of context free with regular languages and Intersection of regular languages with context free both are same of different??? 0 votes 0 votes jaideeppyne commented Dec 9, 2017 reply Follow Share Intersection is commutative. So, both are same. 1 votes 1 votes Please log in or register to add a comment.