33 votes 33 votes Consider the languages: $L_1 = \left\{ a^nb^nc^m \mid n,m >0\right\}$ and $ L_2 = \left\{a^nb^mc^m\mid n, m > 0\right\}$ Which one of the following statements is FALSE? $L_1 \cap L_2$ is a context-free language $L_1 \cup L_2$ is a context-free language $L_1 \text{ and } L_2$ are context-free languages $L_1 \cap L_2$ is a context sensitive language Theory of Computation gatecse-2005 theory-of-computation identify-class-language normal + – Kathleen asked Sep 22, 2014 Kathleen 8.7k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes If $L1∩L2$ is a context-free language then it must also be Context Sensitive language as $CFL ⊂ CSL$ then A must be false apart from best selected answer you can pick up this point too answer Option A Musa answered Oct 17, 2020 Musa comment Share Follow See all 0 reply Please log in or register to add a comment.
–1 votes –1 votes A is false as CFG is not closed under intersection rishu_darkshadow answered Nov 15, 2017 rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.