GATE CS 2018 (Forenoon) — Question 16

Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MCQ1 mark · −1/3 if wrongEasy

Let \(N\) be an NFA with \(n\) states. Let \(k\) be the number of states of a minimal DFA which is equivalent to \(N\). Which one of the following is necessarily true?
  1. A
    \(k \geq 2^n\)
  2. B
    \(k \geq n\)
  3. C
    \(k \leq n^2\)
  4. D
    \(k \leq 2^n\)
Practise the full 2018-FN 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 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