Worst Case Bounds for Maximal Compatible Subsets
Frank Rubin · IEEE Transactions on Computers · 1975
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.