Let 𝐿1 and 𝐿2 be two languages over a finite alphabet, such that 𝐿1∩𝐿2 and…
GATE · 2026 · CS · Set 1 · Computer Science & IT
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?
- A.
L1 is regular
- B.
L1∪𝐿2 is regular
- C.
L2 is context-free
- D.
L1 is context-free
Attempted by 61 students.
Sign up free to check your answer
Sign up freeLoading lesson…