Skip to Main Content
A technique is presented which yields a minimal-state machine satisfying a given set of behavioral specifications. The machine is constructed in the same manner as has commonly been done in the past in synthesizing a ``primitive flow table.'' This contribution consists, not in describing a new method of synthesizing machines, but in showing that a particular instance of an established method yields a minimal-state machine. It is shown that the basic synthesis technique may be slightly modified so as to be applicable to obtaining a minimal-state machine which has the stability condition desired when working with uncloked circuits.