Construction of Minimal Disjunctive Normal Forms
In this paper we present an algorithm for finding one of the minimal disjunctive normal forms (DNF) for an incompletely specified function of the algebra of logic. A completely specified function can be considered as a special case of an incompletely specified function.
KeywordsOrdinal Number Conjunctive Normal Form Minimal Covering Maximal Interval Disjunctive Normal Form
Unable to display preview. Download preview PDF.
- 1.S. V. Yablonskii, “Functional constructions in k-valued logic,” Tr. Matem. Inst. Akad. Nauk SSSR, Vol. 51 (1958).Google Scholar
- 2.W. V. Quine, “The problem of simplifying truth functions,” Am. Math. Monthly, Vol. 59, No. 8 (1952); “A way to simplify truth functions,” Am. Math. Monthly, Vol. 62 (1955); “On cores and prime implicants of truth functions,” Am. Math. Monthly, Vol. 66, No. 9 (1959).Google Scholar
- 3.E. McCluskey, “Minimization of Boolean functions,” Bell System Tech. J., Vol. 35, No. 6 (1956).Google Scholar
- 4.Yu. I. Zhuravlev, “Set-theoretical methods in the algebra of logic,” in: Problems of Cybernetics, Vol. 8, Fizmatgiz (1962).Google Scholar
- 5.R. B. Polansky, “Minimization of multiple-output switching circuits,” Commun. and Electr., No. 53, March (1961).Google Scholar