Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
作者： M. C. Paull , S. H. Unger
关键词:
摘要: Given a sequential switching function in the form of flow table which some entries are unspecified, problem reducing number rows that is extremely complex, and cannot, general, be solved by any simple extension methods used for completely specified functions. An analysis presented, partially enumerative solution evolved. A rough indication efficiency given procedures may obtained from fact these techniques have been successfully applied to approximately two dozen tables ranging up about 15 rows. No required more than hours.
sci-hub.se 参考文章(5)
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
George H. Mealy, A method for synthesizing sequential circuits The Bell System Technical Journal. ,vol. 34, pp. 1045- 1079 ,(1955) , 10.1002/J.1538-7305.1955.TB03788.X
D.A. Huffman, The synthesis of sequential switching circuits Journal of The Franklin Institute-engineering and Applied Mathematics. ,vol. 257, pp. 161- 190 ,(1954) , 10.1016/0016-0032(54)90574-8
D. D. Aufenkamp, Analysis of Sequential Machines II Ire Transactions on Electronic Computers. ,vol. 6, pp. 299- 306 ,(1957) , 10.1109/TEC.1958.5222663
D. D. Aufenkamp, F. E. Hohn, Analysis of Sequential Machines II Ire Transactions on Electronic Computers. pp. 276- 285 ,(1957) , 10.1109/TEC.1957.5222039