Irredundant Normal Forms and Minimal Dependence Sets of a Boolean Function
作者： Halatsis , Gaitanis
关键词:
摘要: A new method is presented for determining all minimal dependence sets, irredundant normal forms, and forms of sets a Boolean function f. The reduces the above problems into those positive respectively, f* corresponding to For each problem cover formula developed such that prime implicants it are in one-to-one correspondence possible solutions.
computer.org
sci-hub.se 参考文章(11)
E. J. McCluskey, Minimization of Boolean Functions* Bell System Technical Journal. ,vol. 35, pp. 1417- 1444 ,(1956) , 10.1002/J.1538-7305.1956.TB03835.X
J.R. Slagle, Chin-Liang Chang, R.C.T. Lee, A New Algorithm for Generating Prime Implicants IEEE Transactions on Computers. ,vol. C-19, pp. 304- 310 ,(1970) , 10.1109/T-C.1970.222917
B. Reusch, Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem IEEE Transactions on Computers. ,vol. 24, pp. 924- 930 ,(1975) , 10.1109/T-C.1975.224338
Pierre Tison, Generalization of Consensus Theory and Application to the Minimization of Boolean Functions IEEE Transactions on Electronic Computers. ,vol. EC-16, pp. 446- 456 ,(1967) , 10.1109/PGEC.1967.264648
D. M. Y. Chang, T. H. Mott, Computing Irredundant Normal Forms from Abbreviated Presence Functions IEEE Transactions on Electronic Computers. ,vol. EC-14, pp. 335- 342 ,(1965) , 10.1109/PGEC.1965.264138
M. J. Ghazala, Irredundant disjunctive and conjunctive forms of a Boolean function Ibm Journal of Research and Development. ,vol. 1, pp. 171- 176 ,(1957) , 10.1147/RD.12.0171
Halatsis, Gaitanis, On the Minimization of the Control Store in Microprogrammed Computers IEEE Transactions on Computers. ,vol. 27, pp. 1189- 1192 ,(1978) , 10.1109/TC.1978.1675024
A. H. Scheinman, A Method for Simplifying Boolean Functions Bell System Technical Journal. ,vol. 41, pp. 1337- 1346 ,(1962) , 10.1002/J.1538-7305.1962.TB03280.X
Thomas H. Mott, Determination of the Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime Implicants Ire Transactions on Electronic Computers. ,vol. 9, pp. 245- 252 ,(1960) , 10.1109/TEC.1960.5219824
W. V. Quine, A Way to Simplify Truth Functions American Mathematical Monthly. ,vol. 62, pp. 627- 631 ,(1955) , 10.1080/00029890.1955.11988710