GATE CS 2026 (Forenoon) — Question 51

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMSQ2 marksEasy

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?
  1. A
    \( L_1 \) is regular
  2. B
    \( L_1 \cup L_2 \) is regular
  3. C
    \( \overline{L_2} \) is context free
  4. D
    \( L_1 \) is context free
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAPractise this subject in the exam simulatorTimed, GATE-style tests with analytics that find your weak topics.
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