Maximum compatible classes from compatibility matrices

Biswas, NN (1989) Maximum compatible classes from compatibility matrices. In: Sadhana, 14 (3). pp. 213-218.

Preview

PDF maximum.pdf - Published Version Download (309kB)

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), where p is the largest cardinality among these classes, and m is the number of such classes. Consequently the algorithm is specially suitable for the state minimization of very large sequential machines as encountered in vlsi circuits and systems.

Item Type:	Journal Article
Publication:	Sadhana
Publisher:	Indian Academy of Sciences
Additional Information:	Copyright of this article belongs to Indian Academy of Sciences.
Keywords:	Compatibility - maximum compatible classes - incompletely specified sequential machines
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	16 Jul 2010 06:42
Last Modified:	27 Feb 2019 09:00
URI:	http://eprints.iisc.ac.in/id/eprint/29292

Actions (login required)

View Item