New Methods of Minimizing Boolean Functions and the Creation of an Automatic Minimizer,

Abstract

Any function of logic algebra can be written as a disjunctive or conjunctive perfect normal form (DPNF, CPNF). Such notation in a number of cases is uneconomical because a large number of standard logic operators are necessary to synthesize it. The logic-algebra function can be represented most economically. At the present time, minimization problems are solved in the following classes: negation, conjunction, and disjunction. This paper will examine a new method of minimizing the DPNF. (Author)

Document Details

Document Type
Technical Report
Publication Date
Mar 20, 1972
Accession Number
AD0744176

Entities

People

  • L. L. Khoroshilskih
  • N. I. Shereshevskii
  • Yu. I. Tsygankov

Organizations

  • National Air and Space Intelligence Center

Tags

DTIC Thesaurus Topics

  • Automatic
  • Complex Variables
  • Functions (Mathematics)
  • Mathematical Analysis
  • Mathematics
  • Notation
  • Standards

Readers

  • Computer Engineering
  • Operations Research
  • Systems Analysis and Design