REFERENCES
- Schwartz (S J). An Algorithm for Minimizing Read only Memories for Machine Control. IEEE 10th Annu. Symp. Switching and Automata Theory. 1968; P 28–33.
- Grasselli (A) and Montanari (U). On the Minimization of Read-Only Memories in Microprogrammed Digital Computers. IEEE Trans. C-19, 11; 1970; 1111–1114.
- Das (S R), Banerjee (D K) and Chattopadhyay (A). On Control Memory Minimization in Microprogrammed Digital Computers. IEEE Trans. C-22, 9; 1973; 845–848.
- McCluskey (E J). Minimization of Boolean Functions. BSTJ. 35, 11; 1956; 1417–1444.
- Pyne (J B) and McCluskey (E J). The Reduction of Redundancy in Solving Prime Implicant Tables. IRE Trans. EC-11. 8; 1962; 473–182.
- Choudhury (A K) and Das (S R). Some Studies on Connected Cover Term Matrices of Switching Functions. Int. J. Control. 2, 11; 1965; 441–501.
- Das (S R). An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representations. IEEE Trans. C-20, 3; 1971; 355–357.
- Das (S R) and Khabra (N S). Clause Column Table Approach for Generating All the Prime Implicants of Switching Functions. IEEE Trans. C-21, 11; 1972; 1239–1246.
- Husson (S S). Microprogramming: Principles and Practices. 1970. Prentice-Hall Inc. New Jersey.