Multiplexer's negation

Бесплатный доступ

The rules of negation (inversion) of orthogonal conjunction of disjunctive normal forms (DNF) used in synthesis algorithms of logical converting automatons in functionally complete and tolerant (FCT) basis are formulated. It is shown, that negation of binary switching function of multiplexer (i.e. generator of function of n variables) results from negation of data variables. Negation rules usage is illustrated by the example of self-synchronous systems having duplex channel of combinational automaton.

Binary switching function, negation (inversion), orthogonal conjunctions, disjunctive normal forms (dns), functionally complete tolerant (fct) basis, logic converter, multiplexer-function generator, automaton

Короткий адрес: https://sciup.org/14729820

IDR: 14729820

Статья научная