Which of the following statements is/are CORRECT?

GATE · 2023 · CS · Computer Science & IT

1. A.

   The intersection of two regular languages is regular.

2. B.

   The intersection of two context-free languages is context-free.

3. C.

   The intersection of two recursive languages is recursive.

4. D.

   The intersection of two recursively enumerable languages is recursively enumerable.

Attempted by 124 students.