GATE CS 2021 (Afternoon) — Question 22

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

Let \(L_1\) be a regular language and \(L_2\) be a context-free language. Which of the following languages is/are context-free?
  1. A
    \(L_1 \cap \overline{L_2}\)
  2. B
    \(\overline{\overline{L_1} \cup \overline{L_2}}\)
  3. C
    \(L_1 \cup (L_2 \cup \overline{L_2})\)
  4. D
    \((L_1 \cap L_2) \cup (\overline{L_1} \cap L_2)\)
Practise the full 2021-AN 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