CALCULATION OF AUTOMATON COMPLEXITY OF BOOLEAN FUNCTIONS AS DISCRETE OPTIMIZATION PROBLEMS

  • Nikolai Ivanovich Kraynyukov
  • Svetlana Valentinovna Pivneva

Abstract

The problem of calculation of complexity of the description булевых functions by means of the disjunctive normal forms, the determined final automatic devices and the ordered binary diagrams is considered. Examples of realization of functions are considered by three ways, their complexity is analysed.

Section
Technical Sciences