Abstract :
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.
Keywords :
Excitation equations, group adjacencies, optimal, sequential machines, state assignment, synchronous.; Binary codes; Cost function; Equations; Flip-flops; Logic; Excitation equations, group adjacencies, optimal, sequential machines, state assignment, synchronous.;
