Skip to main content
SpringerLink
Log in

Maximum compatible classes from compatibility matrices

  • Published:
Sadhana Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Chakraborty A 1987On state minimization of very large incompletely specified sequencial machines, BE project report, Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore

  • 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–156

    Google Scholar 

  • Hill F J, Peterson G R 1981Introduction to switching theory and logical design 3rd ed (New York: Wiley)

    MATH  Google Scholar 

  • Kohavi Z 1978Switching and finite automata theory, 2nd edn (New York: McGraw-Hill)

    MATH  Google Scholar 

  • McCluskey E J 1986Logic design principles (Engelwood Cliffs, NJ: Prentice-Hall)

    Google Scholar 

  • Paull M C, Unger S H 1959IRE Trans. Electron. Comput. EC-8: 356–357

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Communication Engineering, Indian Institute of Science, 560 012, Bangalore, India

    Nripendra N Biswas

Authors
  1. Nripendra N Biswas
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Biswas, N.N. Maximum compatible classes from compatibility matrices. Sadhana 14, 213–218 (1989). https://doi.org/10.1007/BF02812027

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02812027

Keywords

Search

Navigation