A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function
暂无分享,去创建一个
In this correspondence it is shown that by applying Gavrilov's test algorithm to any Boolean function numerically represented by its'' constrained designation numbers'', introduced by Ledley, a very suitable program for the automatic determination of the prime implicants and of the prime implicant table can be established.
[1] E. McCluskey. Minimization of Boolean functions , 1956 .
[2] J. Roth. Algebraic topological methods for the synthesis of switching systems. I , 1958 .
[3] B. Dunham,et al. The Problem of Simplifying Logical Expressions , 1959, J. Symb. Log..
[4] J. Paul Roth,et al. Algorithms for logical design , 1961, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.