Implements a universal finite state automatan.  Using the four data files, I simulated four finite state automata's from this universal finite automata.  The universal finite automata takes in an alphabet, a set of states, a set of final states, and a sequence of transitions of the specific finite automata as inputs.  This specific automata will be able to recognize whether a string belongs to the corresponding language or not.