1 votes 1 votes Can you give an example of NFA which has n states and its corresponding DFA has 2^n states? Theory of Computation theory-of-computation finite-automata number-of-states + – smsubham asked Apr 8, 2018 smsubham 800 views answer comment Share Follow See 1 comment See all 1 1 comment reply srestha commented Apr 8, 2018 reply Follow Share Say there are {a,b,c} three alphabets and want to generate a* then NFA has 1 state DFA has 2 states 0 votes 0 votes Please log in or register to add a comment.