Finite State Machine Emulators

This set of web pages provides three versions of a Finite State Machine emulator together with a set of instructions on their use. Learners should work through the three versions in turn, the final version being an assessment quiz to test your understanding of the concepts. All versions are limited in both their alphabet {0,1} and the number of states (1 starting state named "A", 6 intermediate states named "B" through "G", and 3 ending states named "X", "Y", or "Z"):

  1. Sample Finite State Machines
  2. A "Free Use" version for general experimentation
  3. The graded exercise.

Last updated 2001/06/25
© J.A.N. Lee, 2001.