Sadhana

, 14:213

Maximum compatible classes from compatibility matrices

  • Nripendra N Biswas
Article

DOI: 10.1007/BF02812027

Cite this article as:
Biswas, N.N. Sadhana (1989) 14: 213. doi:10.1007/BF02812027
  • 41 Downloads

Abstract

A fast algorithm for the computation of maximum compatible classes (mcc) among the internal states of an incompletely specified sequential machine is presented in this paper. All the maximum compatible classes are determined by processing compatibility matrices of progressingly diminishing order, whose total number does not exceed (p + m), wherep is the largest cardinality among these classes, andm is the number of such classes. Consequently the algorithm is specially suitable for the state minimization of very large sequential machines as encountered invlsi circuits and systems.

Keywords

Compatibilitymaximum compatible classesincompletely specified sequential machines

Copyright information

© the Indian Academy of Sciences 1989

Authors and Affiliations

  • Nripendra N Biswas
    • 1
  1. 1.Department of Electrical Communication EngineeringIndian Institute of ScienceBangaloreIndia