800 views
1 votes
1 votes
Can you give an example of NFA which has n states and its corresponding DFA has 2^n states?

Please log in or register to answer this question.

Related questions

1 votes
1 votes
2 answers
1
ashishgateashish asked Feb 27, 2018
2,425 views
1. Which solution is correct? (or both wrong!)2. Does every 'DFA equivalent' of any NFA has same starting state? if not, please give any smallest example.
3 votes
3 votes
1 answer
2
0 votes
0 votes
2 answers
3
Mayankprakash asked Nov 9, 2018
1,090 views
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 c...
1 votes
1 votes
1 answer
4
kislaya Pant asked May 8, 2018
1,063 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)....