A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function
作者： N. N. Necula
关键词:
摘要: In this correspondence it is shown that by applying Gavrilov's test algorithm to any Boolean function numerically represented its'' constrained designation numbers'', introduced Ledley, a very suitable program for the automatic determination of prime implicants and implicant table can be established.
sci-hub.se 参考文章(4)
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
Ann C. Ewing, J. Paul Roth, Eric G. Wagner, Algorithms for logical design Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics. ,vol. 80, pp. 450- 458 ,(1961) , 10.1109/TCE.1961.6368615
J. Paul Roth, Algebraic topological methods for the synthesis of switching systems. I Transactions of the American Mathematical Society. ,vol. 88, pp. 301- 326 ,(1958) , 10.1090/S0002-9947-1958-0097285-0
B. Dunham, R. Fridshal, The Problem of Simplifying Logical Expressions Journal of Symbolic Logic. ,vol. 24, pp. 17- 19 ,(1959) , 10.2307/2964570