Sadhana

, 14:213 | Cite as

Maximum compatible classes from compatibility matrices

  • Nripendra N Biswas
Article
  • 44 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

Compatibility maximum compatible classes incompletely specified sequential machines 

References

  1. Chakraborty A 1987On state minimization of very large incompletely specified sequencial machines, BE project report, Department of Electrical Communication Engineering, Indian Institute of Science, BangaloreGoogle Scholar
  2. DeMicheli G, Sangiovanni-Vincentelli A 1983 Computer aided synthesis of PLA based finite state machines,Proc. Int. Conf. on Computer-Aided Design (Washington, DC: IEEE Comput. Soc. Press) pp. 154–156Google Scholar
  3. Hill F J, Peterson G R 1981Introduction to switching theory and logical design 3rd ed (New York: Wiley)MATHGoogle Scholar
  4. Kohavi Z 1978Switching and finite automata theory, 2nd edn (New York: McGraw-Hill)MATHGoogle Scholar
  5. McCluskey E J 1986Logic design principles (Engelwood Cliffs, NJ: Prentice-Hall)Google Scholar
  6. Paull M C, Unger S H 1959IRE Trans. Electron. Comput. EC-8: 356–357CrossRefGoogle Scholar

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

Personalised recommendations