Let 𝐿1 and 𝐿2 be two languages over a finite alphabet, such that 𝐿1∩𝐿2 and…

PYQ GATE 2026

Let 𝐿1 and 𝐿2 be two languages over a finite alphabet, such that 𝐿1∩𝐿2 and 𝐿2 are regular languages. Which of the following statements is/are always true?

  1. A.

    L1 is regular

  2. B.

    L1∪𝐿2 is regular

  3. C.

    L2 is context-free

  4. D.

    L1 is context-free

Attempted by 98 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…