A survey of techniques to reduce/minimize the control part/rom of a microprogrammed digital computer
暂无分享,去创建一个
[1] Min-Wen Du. A Way to Find a Lower Bound for the Minimal Solution of the Covering Problem , 1972, IEEE Transactions on Computers.
[2] Michael J. Flynn,et al. Microprogramming: An Introduction and a Viewpoint , 1971, IEEE Transactions on Computers.
[3] V. M. Glushkov. Automata theory and structural design problems of digital machines , 1965 .
[4] A. T. Mishchenko. Formal synthesis of an automaton by microprogram. II , 1968 .
[5] A. T. Mishchenko,et al. The formal synthesis of an automaton by a microprogram. I , 1968 .
[6] V. M. Glushkov,et al. Automata theory and formal microprogram transformations , 1965 .
[7] Dilip K. Banerji,et al. On Control Memory Minimization in Microprogrammed Digital Computers , 1973, IEEE Transactions on Computers.
[8] V. M. Glushkov. Minimization of microprograms and algorithm schemes , 1966 .
[9] Scott J. Schwartz. An Algorithm for Minimizing Read Only Memories for Machine Control , 1968, SWAT.
[10] Ugo Montanari,et al. On the Minimization of READ-ONLY Memories in Microprogrammed Digital Computers , 1970, IEEE Transactions on Computers.