The Gateway to Computer Science Excellence
+20 votes

Given an arbitrary non-deterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least

  1. $N^2$
  2. $2^N$
  3. $2N$
  4. $N!$
in Theory of Computation by Veteran
edited by | 5.3k views
if NFA has $N$ states then DFA can have  $M$ states where $1\leq M \leq 2^N$

4 Answers

+31 votes
Best answer

Answer is (B) $2^N$.

In DFA any subset of the $N$ states (for $N$ element set $2^N$ subsets possible)  can become a new state and they can remain even when the DFA is minimized. So, maximum we can get $2^N$ states for the minimized DFA. (at least in question must be a typo for at most).

by Loyal
edited by

In DFA any subset of the N states

 This should be "In NFA any subset of the N states..."

+9 votes
Answer is 2^N.

Example DFA-> 3rs symbol from right is x.

Here you have to use 2^3 symbols.

nth symbol from right is x , this DFA will have 2^n state.s
by Boss
0 votes

Answer is B. i.e., 2N

by Active
0 votes
Ans: B
by Loyal

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,215 questions
60,005 answers
94,685 users