GATE CS 2017 (Afternoon) — Question 40

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMCQ2 marks · −2/3 if wrongMedium

Consider the following languages. \(L_1 = \{a^p \mid p \text{ is a prime number}\}\) \(L_2 = \{a^n b^m c^{2m} \mid n \geq 0, m \geq 0\}\) \(L_3 = \{a^n b^n c^{2n} \mid n \geq 0\}\) \(L_4 = \{a^n b^n \mid n \geq 1\}\) Which of the following are CORRECT? I. \(L_1\) is context-free but not regular. II. \(L_2\) is not context-free. III. \(L_3\) is not context-free but recursive. IV. \(L_4\) is deterministic context-free.
  1. A
    I, II and IV only
  2. B
    II and III only
  3. C
    I and IV only
  4. D
    III and IV only
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
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