4th semester Theory of Automata project to convert a user-designed NFA-ε to a DFA.
Uses libfort for outputting well formatted transition tables for the finite automata.
N <- number of states
N space separated strings <- (unique) state labels
T <- number of transitions
T lines of the form a b c each of which signify a transition from a to b on an input c. c = ^ signifies a null transition.