论文信息 - Establishment of irredundant prime implicants in Boolean minimisation techniques

Establishment of irredundant prime implicants in Boolean minimisation techniques

This note details a numerical method whereby redundant terms in a binary minimisation programme may be detected and hence eliminated. The method is in contrast to mapping or chart methods, and hence is amenable to digital-computer programming if desired.

S. L. Hurst | S. Hurst

[1] Graham Flegg. Boolean algebra and its application , 1964 .

[2] D. B. Houghton. Synthesis of electronic computing and control circuits: Vol. 27 of The Annals of the Computation Laboratory of Harvard University, 278 pages, diagrams, 20 × 27 cm. Cambridge, Harvard University Press, 1951. Price, $8.00 , 1952 .

[3] John N. Warfield. A Note on the Reduction of Switching Functions , 1958, IRE Trans. Electron. Comput..

[4] Willard Van Orman Quine,et al. A Way to Simplify Truth Functions , 1955 .