A Note on State Minimization of Asynchronous Sequential Functions

1 February 1967

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers

Vol. EC-16 (1) , 94-97
https://doi.org/10.1109/pgec.1967.264619

Abstract

A procedure is described for minimizing the number of states in an asynchronous sequential function when the restriction exists that the input cannot change while the sequential function is in an unstable state. Furthermore, a procedure is described for minimizing the number of states in a sequential function when the restriction also exists that each output can change at most once during the time required for a transition from one stable state to another.

Keywords

This publication has 5 references indexed in Scilit:

A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
IEEE Transactions on Electronic Computers, 1965
Some Remarks on State Reduction of Asynchronous Circuits by the Paull-Unger Method
IEEE Transactions on Electronic Computers, 1965
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
IEEE Transactions on Electronic Computers, 1959
A Technique for the Reduction of a Given Machine to a Minimal-State Machine
IEEE Transactions on Electronic Computers, 1959
Hazards and Delays in Asynchronous Sequential Switching Circuits
IRE Transactions on Circuit Theory, 1959