Let $L_1, L_2$ be two regular languages and $L_3$ a language which is not regular. Which of the following statements is/are always TRUE?

$L_1 = L_2$ if and only if $L_1 \cap \overline{L_2} = \phi$

$\overline{L_3}$ is not regular

$\overline{L_1 \cup L_2}$ is regular

GATE 2024 CSE & IT Q23 — Computer Science

GATE 2024Set 1Q23MCQanswer keyexplanation soonmedium

Computer Science · Theory of Computation - Regular Languages

Concept intelligence

Drill mode: Regular Languages · 9/47

Studying seriously for GATE CSE?

Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.

Recurring concept

Theory of Computation - Regular Languages has appeared in GATE CSE & IT 3 times across 2 years (2024, 2025).

More questions on Theory of Computation - Regular Languages

∑ has math

Regular LanguagesClosure PropertiesTheory of ComputationGATE CS