GATE CS 2026 (Forenoon) — Question 26

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MSQ1 markMedium

Let \( M \) be a non-deterministic finite automaton (NFA) with 6 states over a finite alphabet. Which of the following options CANNOT be the number of states in the minimal deterministic finite automaton (DFA) that is equivalent to \( M \)?
  1. A
    32
  2. B
    65
  3. C
    1
  4. D
    128
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on Regular Expressions & Finite Automata (DFA/NFA Min)Timed, 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