CS 1104 Introduction to Computer Science


Post class Activity

Design a Finite State Machine, giving both its diagrammatic representation and its tabular description for the recognition of a binary string that starts and finishes with a "0" and contains at least one pair of adjacent "1"s. Thus valid strings would include "0110" (the smallest possible string) and "0000111110".  For the latter string give the list of state transitions that would be used to complete the recognition process.


To test out your design you may want to use the emulation of a FSM constructed by a student in England. Click here.

© J.A.N. LEE
Last Updated 2000/03/28