A finite state machine:
Takes an alphabet of symbols, a start state, and a final state and procesess a tape to determine if the tape ends in the final position from the start position. In the default example we are determining if a number is divisible by 3. A future implementation for this program could be to extend the divisible by 3 operation to divisible by any number provided by the tape or user.
Directions:
Extract the zip file, compile all java files and run Driver
