Title :
Worst Case Bounds for Maximal Compatible Subsets
Author_Institution :
System Development Division, IBM Corporation Poughkeepsie
Abstract :
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.
Keywords :
Incompatibility graph, incompletely specified sequential machine (ISSM), maximal compatible, state mninimization, worst case bound.; Artificial intelligence; Associative memory; Computer aided software engineering; Information processing; Upper bound; Incompatibility graph, incompletely specified sequential machine (ISSM), maximal compatible, state mninimization, worst case bound.;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/T-C.1975.224315
