This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Method for Minimizing Incompletely Specified Sequential Machines
August 1980 (vol. 29 no. 8)
pp. 732-736
M. Yamamoto, Department of Management Engineering, Nagoya Institute of Technology
After Paull and Unger introduced the problem of state minimization in incompletely specified sequential machines (ISSM's), its increasing importance and complexity induced many people to continue research related to this field. Here we shall present a method for obtaining a minimum form of a given ISSM by application of a directed tree graph. In order to save counting effort for a minimum form, we extend the concept of erasure from a relation between compatibles to one between subsets of compatibles. The use of the extended erasure rules can prune the directed tree graph effectively to find a minimum form of a given ISSM. Furthermore, by utilizing the concept of maximal incompatible (MI) we can determine a lower bound for the state number of the minimum form of a given ISSM, and also effectively control the initial steps in generating the directed tree graph.
Index Terms:
state minimization, Complement graph, directed tree graph, incompletely specified sequential machine (ISSM), maximal compatible (MC), maximal incompatibles (MI), minimum form, prime compatible
Citation:
M. Yamamoto, "A Method for Minimizing Incompletely Specified Sequential Machines," IEEE Transactions on Computers, vol. 29, no. 8, pp. 732-736, Aug. 1980, doi:10.1109/TC.1980.1675655
Usage of this product signifies your acceptance of the Terms of Use.