0 votes 0 votes Theory of Computation finite-automata theory-of-computation + – Na462 asked Nov 3, 2018 Na462 453 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Mayankprakash commented Nov 5, 2018 reply Follow Share @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 0 votes 0 votes Mk Utkarsh commented Nov 5, 2018 reply Follow Share 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 0 votes 0 votes Mayankprakash commented Nov 5, 2018 i edited by Mk Utkarsh Nov 5, 2018 reply Follow Share @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 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 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 Dharmendra Verma answered Nov 4, 2018 Dharmendra Verma comment Share Follow See all 0 reply Please log in or register to add a comment.