Correct answer: (A) The intersection of two regular languages is regular.; (C) The intersection of two recursive languages is recursive.; (D) The intersection of two recursively enumerable languages is recursively enumerable.
Explanation
Regular, recursive and RE languages are all closed under intersection. CFLs are not closed under intersection, e.g. {a^n b^n c^m} ∩ {a^m b^n c^n}.
More Regular and Context-Free Languages, Pumping Lemma questions
GATE 2022 CS Q23– Which of the following statements is/are TRUE?
GATE 2022 CS Q47– Consider the following languages: L 1=\anwan w\a,b\*\ L 2=\wxwR w,x\a,b\*, w , x >0\ Note…
GATE 2022 CS Q48– Consider the following languages: L 1=\ww w\a,b\*\ L 2=\anbncm m,n0\ L 3=\ambncn m,n0\…
GATE 2021 CS (CS1) Q11– Suppose that L 1 is a regular language and L 2 is a context-free language. Which one of…
GATE 2020 CS Q18– Consider the following statements. I. If L 1 L 2 is regular, then both L 1 and L 2 must be…
GATE 2020 CS Q20– Consider the language L=\an n 0\\anbn n 0\ and the following statements. I. L is…