Minimization of Boolean functions in the class of orthogonal disjunctive normal formsAn approach to solving the problem of orthogonalization of a
disjunctive normal form (DNF) of a
Минимизация булевых функций в классе ортогональных дизъюнктивных нормальных формMinimization of Boolean functions in the class of orthogonal
disjunctive normal forms Ортогонализация системы ДНФ булевых функций of technical systems, the representation of Boolean functions in the
form of
disjunctive normal forms (DNF
Реализация в FPGA разреженных матричных форм систем ДНФ булевых функцийImplementation in FPGA of sparse systems of
disjunctive normal forms of boolean functions
Signature analysis of circuits with detection of single faults in the
form of a programmed logic matrix on the basis of perfect
disjunctive normal form of the output
Communicatives in the differently structured languages), is solved in the article on the background of the equivalent English
disjunctive question (in which
Signature analysis of circuits with detection of single faults in the
form of a programmed logic matrix on the basis of perfect
disjunctive normal form of the output
BDD and DNF based algorithms for constructing all testability functions of combinational circuit (BDD) and
Disjunctive Normal Form (DNF), as well as methods for constructing Conjunctive
Normal Form