This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines
July 1979 (vol. 28 no. 7)
pp. 531-535
A. Dunworth, University of New South Wales
Two classes of incompletely specified sequential machine (ISSM) are described, which contain the class of input-restricted machines defined by McCluskey [1] and Unger [2] as special cases. These new classes of machine can be identified at the conclusion of a modified (and more efficient) version of the standard compatible pairs-table analysis of Paull and Unger [3]. For such machines only maximal compatible classes need be considered in finding the minimal state machine, and any such covering selection is also closed. An algorithm is presented which is fast and efficient both for hand-use and computer implementation.
Index Terms:
pairs-table analysis, Class-C, class-C1 machines, compatible and image-compatible classes, equivalence and image-equivalence classes, incompletely specified sequential machines, maximal compatibles, minimal covering machines
Citation:
A. Dunworth, H.V. Hartog, "An Efficient State Minimization Algorithm for Some Special Classes of Incompletely Specified Sequential Machines," IEEE Transactions on Computers, vol. 28, no. 7, pp. 531-535, July 1979, doi:10.1109/TC.1979.1675400
Usage of this product signifies your acceptance of the Terms of Use.