GATE CS 2017 (Forenoon) — Question 37

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

Consider the context-free grammars over the alphabet \(\{a, b, c\}\) given below. \(S\) and \(T\) are non-terminals. \(G_1 : S \rightarrow aSb \mid T, T \rightarrow cT \mid \epsilon\) \(G_2 : S \rightarrow bSa \mid T, T \rightarrow cT \mid \epsilon\) The language \(L(G_1) \cap L(G_2)\) is
  1. A
    Finite
  2. B
    Not finite but regular
  3. C
    Context-Free but not regular
  4. D
    Recursive but not context-free
Practise the full 2017-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
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