A reduction technique for prime implicant tables
暂无分享,去创建一个
Solving prime implicant tables is greatly facilitated by reduction techniques such as row dominance, column dominance and essential row selection. This paper presents a new reduction technique which is operable on any otherwise irreducible table having a column covered by two rows.
[1] I. B. Pyne,et al. An Essay on Prime Implicant Tables , 1961 .
[2] Willard Van Orman Quine,et al. A Way to Simplify Truth Functions , 1955 .
[3] E. McCluskey. Minimization of Boolean functions , 1956 .
[4] Willard Van Orman Quine,et al. The Problem of Simplifying Truth Functions , 1952 .
[5] R. Fridshal,et al. An application of linear programming to the minimization of Boolean functions , 1961, SWCT.