Let \(L_1\) be a regular language and \(L_2\) be a context-free language.…

GATE · 2021 · CS · Set 2 · Computer Science & IT

Let $L_1$ be a regular language and $L_2$ be a context-free language. Which of the following languages is/are context-free?

A.
$L_1 \cap \overline{L_2} \\$
B.
$\overline{\overline{L_1} \cup \overline{L_2}} \\$
C.
$L_1 \cup (L_2 \cup \overline{L_2}) \\$
D.
$(L_1 \cap L_2) \cup (\overline{L_1} \cap L_2)$

Attempted by 89 students.

Sign up free to check your answer

Explore the full course: Gate Guidance By Sanchit Sir