Finite State Machine Emulator Instructions

The Finite Machine Emulator allows the user to build simple machines with the inputs consisting of strings of 0s or 1s. The emulator display contains two matrices of squares - the leftmost being the field in which the machine can be built, and that to the right is the array of components to be used. The matrix of machine cells already contains the first or entry state of the machine; the remainder of the machine must be built from this beginning.

To move a machine component from the righthand display to the machine, click first on the component
Then click on the location in the machine cell where you want that component to be placed. WAIT for the item to appear before clicking on another component.
When a transition arrow has been selected, you will be asked for transition character (i.e. that character from the set {0,1} that will trigger the transition).
The transition arrow will be placed in the machine cell showing the appropriate transition character.
State names will be automatically assigned as states are used.

The buttons at the bottom permit the user to perform a number of operations on the developed Finite State Machine. The buttons vary between the practice version and the quiz version.
  • START in the quiz version activates the presentation of the problems and the scoring system. In the practice version you can install (draw, place) a machine into the work space at any time.
  • VALIDATE checks the machine for consistency; this does not however mean that the machine is actually correct for the problem posed.
  • STEP THROUGH allows the user to run the machine against input strings. As the machine operates the transitions used and states visited will be displayed.
  • RESET permits the user to blank out the whole machine matrix of cells to start again in the design process.
  • REDISPLAY displays the original machine after the STEP THROUGH command has been used.
  • TEST in the quiz version permits the user to test the FSM before submitting it to the grader. There is no penalty for using this option.
  • PROBLEM DONE in the quiz version submits the last completed problem to the grader, displays the ACCUMULATED score so far, and displays the next problem. Once all problems have been submitted for grading, the automatic recorder is activiated.

RESTRICTIONS:

The number of states is limited to 1 starting state (predefined), 7 intermediate states (named B through H) and three ending states (X, Y, and Z). The number of arcs are only limited by the available space.


Last updated 2000/11/09
© J.A.N. Lee, 2000.