GATE CS 2026 (Afternoon) — Question 48

Theory of Computation (TOC)Regular and Context-Free Languages & Pumping LemmaMSQ2 marksHard

Let \( \Sigma = \{a, b, c, d\} \) and let \( L = \{a^i b^j c^k d^l \mid i, j, k, l \ge 0\} \). Which of the following constraints ensure(s) that the language \( L \) is context-free?
  1. A
    \( i + k = j + l \)
  2. B
    \( i = k \) and \( j = l \)
  3. C
    \( i = l \) and \( j = k \)
  4. D
    \( i + j = k + l \)
Practise the full 2026-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