Q41

MCQ2 marks, −0.67

Let $L_{1}$ and $L_{2}$ be two languages over a finite alphabet, such that $L_{1} \cap L_{2}$ and $L_{2}$ are regular languages. Which of the following statements is/are always true?

(A)

$L_{1}$ is regular

(B)

$L_{1} \cup L_{2}$ is regular

(C)

$\overline{L_{2}}$ is context-free

(D)

$L_{1}$ is context-free

Loading…