GATE CS 2017 (Forenoon) — Question 38

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

Consider the following languages over the alphabet \(\Sigma = \{a, b, c\}\). Let \(L_1 = \{a^n b^n c^m \mid m, n \geq 0\}\) and \(L_2 = \{a^m b^n c^n \mid m, n \geq 0\}\). Which of the following are context-free languages? I. \(L_1 \cup L_2\) II. \(L_1 \cap L_2\)
  1. A
    I only
  2. B
    II only
  3. C
    I and II
  4. D
    Neither I nor II
Practise the full 2017-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
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