This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Uniform Decomposition of Incompletely Specified Sequential Machines
August 1975 (vol. 24 no. 8)
pp. 840-843
G.H. Williams, Department of Electrical Engineering, Union College
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.
Index Terms:
Covering problem, incompletely specified, sequential machines, uniform decomposition.
Citation:
G.H. Williams, "Uniform Decomposition of Incompletely Specified Sequential Machines," IEEE Transactions on Computers, vol. 24, no. 8, pp. 840-843, Aug. 1975, doi:10.1109/T-C.1975.224319
Usage of this product signifies your acceptance of the Terms of Use.