UMBC CMSC 313, Computer Organization & Assembly Language, Fall 2004, Section 0101

Finite State Machines

Tuesday 11/23, 2004

Up]

Assigned Reading in Murdocca & Heuring:  A.12-A.13, B.3

Assigned Reading in Neveln:   

Assigned:   

Due:   

Slides (in PDF): Slides23.pdf

Topics Covered:

• Recap: Mealy versus Moore machines.
• Vending machine example.
• Sequence detector example. (How to check the implementation of a finite machine in DigSim.)
• State reduction algorithm and example.

Circuits in DigSim:

Following these links will launch the DigSim Java applet and load the circuit described.

• A Mod 4 Counter (Mealy)
• A Mod 4 Counter (Moore)
• A Sequence Detector (bug fixed)
• A Sequence Detector (optimized with K-maps)