A new method for state simplification in incompletely specified sequential machines

  • Wang Wenzhang 
  • Lu Yingping 
Regular Papers
  • 18 Downloads

Abstract

This paper presents a method for state simplification in incompletely specified sequential machines. The new method adopts Inclusive-OR operation of column vectors for multi-level output matrix Ek! Compared with other algorithms in use, this method is theoretically more strict, while its structure is simple and the results obtained are accurate.

References

  1. [1]
    Luo Zhaojie, Digital Logic Design Fundamentals. People's Post and Telecommunication Press, 1983.Google Scholar
  2. [2]
    H. Troy Nagle. Jr, B. D. Carroll, J. David Irwin, An Introduction to computer Logic. Prentice-Hall, Inc. 1975.Google Scholar
  3. [3]
    Zhang Shaoxian, Zhu Jingui, Digital Logic. National Defence Science and Technology University Press, 1986.Google Scholar
  4. [4]
    Wang Wenzhang, A mathematical model for sequential machines.Journal of Human Science and Technology University, 1985, 1 (4).Google Scholar
  5. [5]
    Wang Wenzhang, tian Shaohuai and Zhang Ruijian, A mathematical method for solving synchronous sequential machine.Chinese Journal of Computers, 1988, 11 (5).Google Scholar
  6. [6]
    Wang Wenzhang, Tian Shaohuai and Zhang Rujian, A parallel algorithm for solving the shortest distinguishing sequences.Chinese Journal of Computers, 1990, 13 (1).Google Scholar
  7. [7]
    Wang Wenzhang, Tian Shaohuai and Zhang Ruijian, A mapping method of faulty matrix.Chinese Journal of Computers, 1990, 13 (7).Google Scholar
  8. [8]
    Wang Wenzhang, A parallel algorithm for state simplification.Chinese Journal of Computers, 1990, 13 (11).Google Scholar
  9. [9]
    Liu Mingye, Theory to Computer Aided Logic Design. Science Press, 1985.Google Scholar
  10. [10]
    Kella, J., State Minimization of Incompletely Specified Sequential Machines.IEEE Trans. Computers, 1970. C-19, 342–8.MATHCrossRefMathSciNetGoogle Scholar
  11. [11]
    Biswas, N., State minimization of incompletely specified sequential machines.IEEE Trans. Computers, 1974, C-23, 380–4.CrossRefGoogle Scholar
  12. [12]
    Hill, F. J and Peterson, G. R., Introduction to Switching Theory and Logical Design. New York, John Wiley & Sons, Inc. 1981.MATHGoogle Scholar
  13. [13]
    C. L. Samuel, Modern Switching Theory and Digital Design. Prentice-Hall, Inc. USA, 1978.Google Scholar
  14. [14]
    Paull, M. C. and Ungar, S. H., Minimizing the number of states in incompletely specified sequential switching function.IRE Trans. Electron. Computers, 1959, EC-8, 356–366.CrossRefGoogle Scholar
  15. [15]
    Grasselli, A. and Luccio, F., A method for minimizing the number of internal states in incompletely specified sequential networks.IEEE Trans, Computers, C-14, 350–9, 1965.MATHCrossRefGoogle Scholar
  16. [16]
    Yang, C., Closure partition method for minimizing incomplete sequential machines.IEEE Trans. Computers, 1973, C-22, 1109–1122.MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 1992

Authors and Affiliations

  • Wang Wenzhang 
    • 1
  • Lu Yingping 
    • 2
  1. 1.Dept. of Computer ScienceChina Insurance Administrative Cadres CollegeChangsha
  2. 2.Dept. of Computer ScienceHuman UniversityChangsha

Personalised recommendations