Intuitively a finite automaton is a mathematical model of computing device that has discrete inputs and outputs as well as a finite set of internal states. The automaton takes as input a sequence of symbols drawn from an alphabet of symbols, and after reading each symbol in sequence, the automaton makes a transition from its current state to a new state depending on the value of the input read. Mathematically this behavior is specified by a 5-tuple of data (Q,A,T,I,F). Here Q is the set of states of the automaton, finite in number. A is the alphabet from which sequences of input symbols are drawn. T is the transition function from Q*A to Q that takes a state q in Q and a symbol a in A and returns a new state r, which is the state the automaton should make...