Updated the printing on the dfa to more closely match the document.
Started the NFA, need to come up with a plan for handling lambda transitions.
Then need to implement NFA-DFA and write the formal NFA parser and the formal DFA printer.
-Created the FA class to hold the in common aspects of both DFA and NFA classes.
-Reshuffled some methods and logic around to fit this new structure.
-Next step is the NFA-to-DFA conversion, then the NFA parser, then the DFA pretty print
-Maybe a GUI?  Bonus asks to give a graphical representation of a DFA.
Changed NFA transf to map to a set of states rather than single states to allow for multiple transitions on a single input.  The transition function had to be altered slightly to accomodate this change.