UMBC CMSC 313, Computer Organization & Assembly Language, Fall 2004, Section 0101
Finite State Machines
Tuesday 11/23, 2004
Assigned Reading in Murdocca & Heuring: A.12-A.13, B.3
Assigned Reading in Neveln:
Slides (in PDF): Slides23.pdf
- 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.
9 Dec 2004 12:43:24 EST
to Fall 2004 CMSC 313 Section Homepage