Finite State Machine

Objectives

1. Refresh programming skills including use of arrays and objects
2. Learn about finite state machines.

Assignment

1. Complete the program that simulates a finite state machine.
2. You are provided with the following. All files are found on the shared drive for the class in the lab 1 folder. a. Transition.java. This class defines a single transition. Given a state and an input what is the next state. a. FSMDriver.java. This class contains a very simple driver. It instantiates a finite state machine from a file and then tests one string for acceptance. a. Simple. This is an example of a data file as follows i. Line 1: the alphabet of the machine (each one is a character) i. Line 2: the number of states in the machine (always integers) i. Line 3: which state is the initial state i. Next set of lines (until -1): one line (old state, new state, character) representing a transition. i. Last: a list of states (terminated with a -1) of final states
   1. FSM.java. The shell for the finite state machine with methods you need to complete. See comments within the code for more instructions
   2. Transitions. The shell for a list of transitions with methods and field variables you need to complete. See comments within the code for more instructions.
3. Be sure to modify the comments as appropriate and maintain good programming techniques

Submission instructions

1. Complete the SDR. Be aware that the form has changed! Include at least one more set of tests for your own machine along with any other tests you think are appropriate. Your testing report should probably not be more than a page and could be less.
2. Combine your SDR and all of your .java and testing files into one zip folder
3. Submit the zip folder on Canvas by the due data specific there.

Restriction:

Challenges

1. Don't use some/all of the provided code. If this is the case, indicate in an obvious way that you did this in your SDR.