Issue No.03 - March (1974 vol.23)
P.S. Noe , Department of Electrical Engineering, Texas A and M University
In a recently published article, Story et al. detailed an organized search process leading to the optimum state assignment for a synchronous sequential machine. Their procedure begins with the calculation of a set of lower bounds (minimum numbers) on the costs of the excitation logic required for each possible distinct partial state assignment.
Excitation equations, group adjacencies, optimal, sequential machines, state assignment, synchronous.
P.S. Noe, "A Modification to the SHR-Optimal State Assignment Procedure", IEEE Transactions on Computers, vol.23, no. 3, pp. 327-329, March 1974, doi:10.1109/T-C.1974.223933