title: NFA to DFA implementation in C++
body: <p>The title says it all. I need some ideas.
  The nfa input looks like this and has no epsilon moves.</p>
  
  <pre><code>1 2
  0 a 2
  1 b 3
  </code></pre>
  
  <p>etc, meaning that 1 and 2 ar final states and that with 'a' I can get from state 0 to state 2.</p>
  
  <p>I use</p>
  
  <pre><code>struct nod
  {
  int ns;
  char c;
  };
  
  vector&lt;nod&gt; v[100];
  </code></pre>
  
  <p>to save the data, where v[i] is the vector containing all the ways that can go from state i.
  <strong>I need an idea on how to name the new states when there is a multiset of states like</strong></p>
  
  <pre><code>0 a 1
  0 a 2
  0 a 3
  </code></pre>
  
  <p>because i can't create state 123 or something like that.
  <strong>And how can i check if a multiset has already been transformed in a state?</strong></p>