Advertisement

Abstract

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.

Keywords

Ordinal Number Conjunctive Normal Form Minimal Covering Maximal Interval Disjunctive Normal Form 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    S. V. Yablonskii, “Functional constructions in k-valued logic,” Tr. Matem. Inst. Akad. Nauk SSSR, Vol. 51 (1958).Google Scholar
  2. 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. 3.
    E. McCluskey, “Minimization of Boolean functions,” Bell System Tech. J., Vol. 35, No. 6 (1956).Google Scholar
  4. 4.
    Yu. I. Zhuravlev, “Set-theoretical methods in the algebra of logic,” in: Problems of Cybernetics, Vol. 8, Fizmatgiz (1962).Google Scholar
  5. 5.
    R. B. Polansky, “Minimization of multiple-output switching circuits,” Commun. and Electr., No. 53, March (1961).Google Scholar

Copyright information

© Consultants Bureau, New York 1969

Authors and Affiliations

  • N. A. Gorbovitskaya
  • I. Sh. Pinsker

There are no affiliations available

Personalised recommendations