Title :
Uniform Decomposition of Incompletely Specified Sequential Machines
Author :
Williams, George H.
Author_Institution :
Department of Electrical Engineering, Union College
Abstract :
In this correspondence uniform decomposition procedures are extended to incompletely specified sequential machines. Any given Moore sequential machine is realized by interconnecting copies of a universal two-state component machine. The information processed by each component machine is represented by its corresponding partial mapping. When the sequential machine is incompletely specified, a reduction in the number of component machine copies is possible. The reduction is found by a uniform-cost search algorithm which finds a minimal cover on the set of partial mappings.
Keywords :
Covering problem, incompletely specified, sequential machines, uniform decomposition.; Binary trees; Integrated circuit interconnections; Sequential circuits; Signal mapping; Covering problem, incompletely specified, sequential machines, uniform decomposition.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1975.224319