NFA and DFA for Thompson and Subset constructions

[pmcarpan]

To Implement:

• [x] Basic structure of NFA state and create transition functions
• [x] DFA

I'd suggest to put them in a separate package named automata or something, as they are not related with the algorithms.

[287mdsahil]

@pmcarpan why is the number of states an argument to the NFA constructor? Generally thinking won't it be better if someone could initialize an NFA without knowing the number of states predefined by simply calling: NFA nfa = new NFA(); nfa.addTransition( ... ); nfa.setStartState(...); nfa.setFinalStates(...);

[pmcarpan]

@pmcarpan why is the number of states an argument to the NFA constructor? Generally thinking won't it be better if someone could initialize an NFA without knowing the number of states predefined by simply calling: ...

increaseNumberOfStates will be used in both cases, either internally or externally. I though it was better to give explicit control.