• DocumentCode
    1118928
  • Title

    Worst Case Bounds for Maximal Compatible Subsets

  • Author

    Rubin, Frank

  • Author_Institution
    System Development Division, IBM Corporation Poughkeepsie
  • Issue
    8
  • fYear
    1975
  • Firstpage
    830
  • Lastpage
    831
  • 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.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1975.224315
  • Filename
    1672908
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1118928