Finite Automata

Question

 

Comments

How can one tell number of states in NFA from states of an arbitrary DFA

---

It's b
because a DFA is an NFA. So the states can remain to be the same.

---

@vikas @dharmendra @mk Utkarsh

Im not able to understand this concept.

Please explain.

As per my understanding in DFA, For N states there can be N transition so N states should be there and for NFA for N states there can be 2 ^N transition so 2^N states.

Please suggest

---

Mayankprakash ignore this question because they are not talking about minimal DFA

if they would have been talking about minimal DFA with $2^N$ states then states in the corresponding NFA can range between $N$ and $2^N$

from this information we can eliminate A and D

but then read the first line of this comment :p

---

@mk Utkarsh

if they would have been talking about minimal DFA with $2^N$ states then states in the corresponding NFA can range between $N$ and

How?

Please explain

Answer 1

Every DFA can be NFA. If NFA have 'n' states then DFA have maximum 2^n states.

So option B is correct.

Power of NFA = Power of DFA