GATE CS 2025 (Afternoon) — Question 24

Theory of Computation (TOC)Context-Free Grammars & Push-Down AutomataMCQ1 mark · −1/3 if wrongEasy

Which ONE of the following languages is accepted by a deterministic pushdown automaton?
  1. A
    Any regular language.
  2. B
    Any context-free language.
  3. C
    Any language accepted by a non-deterministic pushdown automaton.
  4. D
    Any decidable language.
Practise the full 2025-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Context-Free Grammars & Push-Down AutomataTimed, 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