GATE CS 2021 (Forenoon) — Question 11

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMCQ1 mark · −1/3 if wrongMedium

Suppose that \(L_1\) is a regular language and \(L_2\) is a context-free language. Which one of the following languages is NOT necessarily context-free?
  1. A
    \(L_1 \cap L_2\)
  2. B
    \(L_1 \cdot L_2\)
  3. C
    \(L_1 - L_2\)
  4. D
    \(L_1 \cup L_2\)
Practise the full 2021-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