Recursive Operators for Prime Implicant and Irredundant Normal Form Determination
暂无分享,去创建一个
[1] Melvin A. Breuer,et al. General survey of design automation of digital computers , 1966 .
[2] Roy M. Proctor. A Logic Design Translator Experiment Demonstrating Relationships of Language to Systems and Logic Design , 1964, IEEE Trans. Electron. Comput..
[3] Willard Van Orman Quine,et al. The Problem of Simplifying Truth Functions , 1952 .
[4] R. McNaughton,et al. The minimality of rectifier nets with multiple outputs incompletely specified , 1957 .
[5] Herbert Schorr. Computer-Aided Digital System Design and Analysis Using a Register Transfer Language , 1964, IEEE Trans. Electron. Comput..
[6] Eugenio Morreale. Computational Complexity of Partitioned List Algorithms , 1970, IEEE Transactions on Computers.
[7] Thomas H. Mott,et al. Determination of the Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime Implicants , 1960, IRE Trans. Electron. Comput..
[8] E. McCluskey. Minimization of Boolean functions , 1956 .
[9] Eugenio Morreale,et al. Computer Experience on Partitioned List Algorithms , 1970, IEEE Transactions on Computers.
[10] Willard Van Orman Quine,et al. A Way to Simplify Truth Functions , 1955 .
[11] Midhat J. Ghazala. Irredundant Disjunctive and Conjunctive Forms of a Boolean Function , 1957, IBM J. Res. Dev..
[12] Eugenio Morreale,et al. Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms , 1967, IEEE Trans. Electron. Comput..