Synthesis of Minimal-State Machines
- 1 December 1959
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-8 (4) , 441-449
- https://doi.org/10.1109/tec.1959.5222056
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959
- A Technique for the Reduction of a Given Machine to a Minimal-State MachineIEEE Transactions on Electronic Computers, 1959
- On the Reduction of Superfluous States in a Sequential MachineJournal of the ACM, 1959
- A Note on Memory Aspects of Sequence TransducersIRE Transactions on Circuit Theory, 1959
- A Synthesis Technique for Minimal State Sequential MachinesIEEE Transactions on Electronic Computers, 1959
- A method for synthesizing sequential circuitsBell System Technical Journal, 1955
- The synthesis of sequential switching circuitsJournal of the Franklin Institute, 1954