The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+15 votes
4k views

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!$
asked in Theory of Computation by Veteran (52k points)
edited by | 4k views

4 Answers

+26 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).

answered by Loyal (8.1k points)
edited by
0

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.

https://gateoverflow.in/544/gate1991_17-b

Here you have to use 2^3 symbols.

nth symbol from right is x , this DFA will have 2^n state.s
answered by Boss (41k points)
0 votes

Answer is B. i.e., 2N

answered by Active (2.4k points)
0 votes
Ans: B
answered by Loyal (6.9k points)
Answer:

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
49,548 questions
54,169 answers
187,464 comments
71,120 users