0 votes 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 Thanks Theory of Computation number-of-states finite-automata theory-of-computation + – Mayankprakash asked Nov 9, 2018 Mayankprakash 1.1k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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. goxul answered Nov 9, 2018 • selected Nov 10, 2018 by Mayankprakash goxul comment Share Follow See all 0 reply Please log in or register to add a comment.
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 Ravijha answered Jun 20, 2019 Ravijha comment Share Follow See all 0 reply Please log in or register to add a comment.