1,137 views

2 Answers

Best answer
2 votes
2 votes

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
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 votes
1 votes
1 answer
1
kislaya Pant asked May 8, 2018
1,123 views
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)....
3 votes
3 votes
2 answers
3
Sona Barman asked Jan 15, 2018
2,334 views
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.
1 votes
1 votes
0 answers
4
Warlock lord asked Nov 12, 2017
2,191 views
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 sta...