GATE CS 2025 (Afternoon) — Question 25

Theory of Computation (TOC)Turing Machines & UndecidabilityMCQ1 mark · −1/3 if wrongMedium

Let \( G_1 \), \( G_2 \) be Context Free Grammars (CFGs) and \( R \) be a regular expression. For a grammar \( G \), let \( L(G) \) denote the language generated by \( G \). Which ONE among the following questions is decidable?
  1. A
    Is \( L(G_1) = L(G_2) \)?
  2. B
    Is \( L(G_1) \cap L(G_2) = \emptyset \)?
  3. C
    Is \( L(G_1) = L(R) \)?
  4. D
    Is \( L(G_1) = \emptyset \)?
Practise the full 2025-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 Turing Machines & UndecidabilityTimed, 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