2 votes 2 votes If NFA has n states, then its DFA can have______states in worst case. Theory of Computation theory-of-computation finite-automata minimal-state-automata + – anonymous asked Sep 9, 2015 anonymous 1.8k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 2N states in maximum case ANI answered Sep 9, 2015 ANI comment Share Follow See 1 comment See all 1 1 comment reply Jaydeep Purohit 2 commented Dec 24, 2017 reply Follow Share Won't that be less than 2^n. i.e (2^n) - 1 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes 2^N Reason; The next state of nfa coud be any subset of state . no of subset of states=2^n(as we have 2 choices for each state either we can keep it or not in our subset ) Saurav answered Sep 10, 2015 Saurav comment Share Follow See all 0 reply Please log in or register to add a comment.