A Decomposition Method of Determining Maximum Compatibles
作者： PK Sinha Roy , Ching-Lai Sheng , None
关键词:
摘要: A direct method of determining the maximum compatibility sets an incompletely specified flow table a sequential machine is presented. Subsets pairwise incompatibles are utilized to decompose set all states in step-by-step process into compatibles few steps. The simpler and faster than previously reported tabular, algebraic, graphical techniques.
computer.org
sci-hub.se 参考文章(7)
M. P. Marcus, Derivation of maximal compatibles using Boolean algebra Ibm Journal of Research and Development. ,vol. 8, pp. 537- 538 ,(1964) , 10.1147/RD.85.0537
S.R. Das, C.L. Sheng, On finding maximum compatibles Proceedings of the IEEE. ,vol. 57, pp. 694- 695 ,(1969) , 10.1109/PROC.1969.7028
Seymour Ginsburg, On the Reduction of Superfluous States in a Sequential Machine Journal of the ACM. ,vol. 6, pp. 259- 282 ,(1959) , 10.1145/320964.320983
A. Grasselli, F. Luccio, A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks IEEE Transactions on Electronic Computers. ,vol. EC-14, pp. 350- 359 ,(1965) , 10.1109/PGEC.1965.264140
M. C. Paull, S. H. Unger, Minimizing the Number of States in Incompletely Specified Sequential Switching Functions Ire Transactions on Electronic Computers. ,vol. 8, pp. 356- 367 ,(1959) , 10.1109/TEC.1959.5222697
W. S. Meisel, A Note on Internal State Minimization in Incompletely Specified Sequential Networks IEEE Transactions on Electronic Computers. ,vol. EC-16, pp. 508- 509 ,(1967) , 10.1109/PGEC.1967.264674
J. Kella, State Minimization of Incompletely Specified Sequential Machines IEEE Transactions on Computers. ,vol. C-19, pp. 342- 348 ,(1970) , 10.1109/T-C.1970.222920