A Modification to the SHR-Optimal State Assignment Procedure
Philip S. Noe, V. Thomas Rhyne · IEEE Transactions on Computers · 1974
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.