This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Worst Case Bounds for Maximal Compatible Subsets
August 1975 (vol. 24 no. 8)
pp. 830-831
F. Rubin, System Development Division, IBM Corporation Poughkeepsie
An exact upper bound is found for the number of maximal compatible subsets of an n-state incompletely specified sequential machine (ISSM). This bound, on the order of 3n/3, iS also a worst case computer storage and computation time limit for any algorithm to find maximal compatibles.
Index Terms:
Incompatibility graph, incompletely specified sequential machine (ISSM), maximal compatible, state mninimization, worst case bound.
Citation:
F. Rubin, "Worst Case Bounds for Maximal Compatible Subsets," IEEE Transactions on Computers, vol. 24, no. 8, pp. 830-831, Aug. 1975, doi:10.1109/T-C.1975.224315
Usage of this product signifies your acceptance of the Terms of Use.