Next-State Maps: Summary of Example
? Need 6 gates and 13 gate-inputs to implement the machine using this assignment.
??Straight binary assignment (q0=000, q1=001, etc.) would yield 10 gates and 39 gate-inputs.
??The approach gave good results in this example, but that is not always the case.