This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
State Minimization of Incompletely Specified Sequential Machines
January 1974 (vol. 23 no. 1)
pp. 80-84
N.N. Biswas, Department of Electrical Communication Engineering, Indian Institute of Science
A simple procedure for the state minimization of an incompletely specified sequential machine whose number of internal states is not very large is presented. It introduces the concept of a compatibility graph from which the set of maximal compatibles of the machine can be very conveniently derived. Primary and secondary implication trees associated with each maximal compatible are then constructed. The minimal state machine covering the incompletely specified machine is then obtained from these implication trees.
Index Terms:
Augmentation, bunching, compatibility graph, implication trees, incompletely specified sequential machine, maximal compatibles, merger graph, sequential machine, state minimization, state reduction, substitution.
Citation:
N.N. Biswas, "State Minimization of Incompletely Specified Sequential Machines," IEEE Transactions on Computers, vol. 23, no. 1, pp. 80-84, Jan. 1974, doi:10.1109/T-C.1974.223780
Usage of this product signifies your acceptance of the Terms of Use.