CS 150 Homework #12
Due Dec 3rd

(1) Which will be smaller, a mealy or moore machine?

(2) Show that you understand how to reduce finite state machines.

(3) Devize the sending and recieving circuts to implement a 4 state asynchronous communication protocol. Both sides have their own LOCAL clocks, which may run at different speeds. There should be a 1 cycle delay between sending the data and asserting the ACK line.

This page is maintained by Nick Weaver (nweaver@cs.berkeley.edu)