GATE CS 2017 (Afternoon) — Question 4

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

Let \(L_1, L_2\) be any two context-free languages and \(R\) be any regular language. Then which of the following is/are CORRECT? I. \(L_1 \cup L_2\) is context-free. II. \(\overline{L}_1\) is context-free. III. \(L_1 - R\) is context-free. IV. \(L_1 \cap L_2\) is context-free.
  1. A
    I, II and IV only
  2. B
    I and III only
  3. C
    II and IV only
  4. D
    I only
Practise the full 2017-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