Theory of Computation - Automata

GATE CSE & IT · 2 questions across 2 years (2017-2025) · 5% recurrence rate

Start topic drill Back to CSE & IT

Recurrence sparkline

2017–2025

201720212025

Difficulty mix

med 50%

hard 50%

Question types

MCQ2

All 2 questions on Theory of Computation - Automata

2025 Q24

Which ONE of the following languages is accepted by a deterministic pushdown automaton?

Med✓

2017 Q25

The minimum possible number of states of a deterministic finite automaton that accepts the regular language L = {w1aw2 | w1, w2 ∈ {a, b}*, |w1| = 2, |w2| ≥ 3} is

Hard✓