Worst Case Bounds for Maximal Compatible Subsets | IEEE Journals & Magazine | IEEE Xplore
Subscribe
ADVANCED SEARCH
Journals & Magazines >IEEE Transactions on Computers >Volume: C-24 Issue: 8

Worst Case Bounds for Maximal Compatible Subsets

PDF
F. Rubin
All Authors

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/...Show More

Metadata

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.
Published in: IEEE Transactions on Computers ( Volume: C-24, Issue: 8, August 1975)
Page(s): 830 - 831
Date of Publication: 14 August 2006

ISSN Information:

DOI: 10.1109/T-C.1975.224315

Contact IEEE to Subscribe

References

References is not available for this document.

IEEE Account

Purchase Details

Profile Information

Need Help?

A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.