Log In
0 votes
If NFA has 'n' states then how DFA can have 2^n  states. Please help me in understanding how this is true.

As per my understanding every DFA is NFA then how no of states can be more in DFA than nfa

Please suggest

in Theory of Computation 174 views

2 Answers

2 votes
Best answer

Correction: If a NFA has $n$ states, the DFA can have at most $2^N$ states.

This is because each state of the NFA can be a part of the DFA or not - thus we have two choices for each state and $n$ such choices to make, thus giving us $2^N$ states.

selected by
2 votes

Every DFA is NFA.....

let us say NFA has N states

when we convert NFA to DFA 

in worst case we get 2^N states in DFA

Related questions

1 vote
1 answer
Ques:- What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of the string is not congruent to 0 (mod 4).
asked May 8, 2018 in Theory of Computation kislaya Pant 207 views
0 votes
3 answers
Ques:- Let ∑= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8)? *[ Can anybody explain this as I am getting 8 states for this since remainders will be 8 (0,1,2,3,4,5,6,7). But the answer is 4].
asked May 8, 2018 in Theory of Computation kislaya Pant 907 views
3 votes
2 answers
Self doubt: Is there any method to calculate number of states in dfa e.g."x mod y" type of question without drawing dfa? Because in Gate time is vital factor.
asked Jan 15, 2018 in Theory of Computation Sona Barman 477 views
1 vote
0 answers
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s. How many states does the above DFA have? How many final states? Please explain your answer.
asked Nov 12, 2017 in Theory of Computation Warlock lord 604 views