GATE CS 2020 (Forenoon) — Question 42

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

Consider the following languages. \( L_1 = \{wxyx \mid w, x, y \in (0 + 1)^+\} \) \( L_2 = \{xy \mid x, y \in (a + b)^*, |x| = |y|, x \neq y\} \) Which one of the following is TRUE?
  1. A
    \( L_1 \) is regular and \( L_2 \) is context-free.
  2. B
    \( L_1 \) is context-free but not regular and \( L_2 \) is context-free.
  3. C
    Neither \( L_1 \) nor \( L_2 \) is context-free.
  4. D
    \( L_1 \) is context-free but \( L_2 \) is not context-free.
Practise the full 2020-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