title: NFA to DFA question
body: <p>First, this is not a question asking for the algorithm to convert a NFA to DFA.</p>
  
  <p>It's known (and proved) that the equivalent DFA of a NFA has at most 2<sup>n</sup> states, even though most of the times it will have more or less the same number of states as the NFA.</p>
  
  <p>How may I predict an estimate for the number of states the NFA-equivalent DFA will have? Which particular type of NFA will require an equivalent DFA to have 2<sup>n</sup> states?</p>
  
  <p>My reason for asking this is to be able to "invent" some NFAs that will certainly produce, without considering minimization, 2<sup>n</sup> - 1 states plus the "dead state".</p>