Problem 1: There are 3 different ways to describe a sequential machine.
a) State Table
b) State Graph
c) Next State and Output Equations For each case
Explain how the description would be different for MEALY and MOORE machines (or whether they are the same).
Problem 2: How were the guidelines for the state assignment derived? What were the rationales? Since we have superfast computers now, can we not just try all the possibilities and pick the best assignment?