GATE CS 2024 (Forenoon) — Question 23

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMSQ1 markMedium

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?
  1. A
    \( L_1 = L_2 \) if and only if \( L_1 \cap \overline{L_3} = \phi \)
  2. B
    \( L_1 \cup L_3 \) is not regular
  3. C
    \( \overline{L_3} \) is not regular
  4. D
    \( \overline{L_1 \cup L_2} \) is regular
Practise the full 2024-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkIntroduction to Automata Theory (Hopcroft & Ullman)Regular languages, CFGs, pushdown automata and Turing machines.
Practise more on Regular and Context-Free Languages & Pumping LemmaTimed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group