Added link for NFA-DFA conversion process
Added link for NFA-DFA conversion process

We will need this because it is an EXTREMELY nontrivial problem
to simply generate a complete and minimal DFA from a regex
if that regex contains any kind of optional elements.
We need to follow this process:
- Do the transformation as we do now, but using epsilon edges everywhere
  possible.
- Perform a NFA reduction to DFA as specified in the article:
  - Perform an epsilon-closure of each transition to determine the
    necessary states.
  - Any DFA states that contain NFA states that were complete states
    automatically become complete states.
- Perform a reduction by finding any states with the exact same set of
  transitions, i.e. for the same characters they transition to the same
  states, and reduce the state machine so that all transitions to either
  state just transition to one of them.
- We will need to determine how to handle default transitions in this new
  process.

jchitel/InterParse