On Control Memory Minimization in Microprogrammed Digital Computers
暂无分享,去创建一个
[1] S. R. Das,et al. An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representation , 1971, IEEE Transactions on Computers.
[2] A. Mukhopadhyay,et al. A method of determination of all the minimal forms of Boolean functions , 1962 .
[3] S. R. Das,et al. On finding maximum compatibles , 1969 .
[4] Ugo Montanari,et al. On the Minimization of READ-ONLY Memories in Microprogrammed Digital Computers , 1970, IEEE Transactions on Computers.
[5] Fabrizio Luccio,et al. A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks , 1965, IEEE Trans. Electron. Comput..
[6] Stephen H. Unger,et al. Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..
[7] Sunil R. Das,et al. Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions , 1972, IEEE Transactions on Computers.
[8] Scott J. Schwartz. An Algorithm for Minimizing Read Only Memories for Machine Control , 1968, SWAT.