On representation of boolean functions by repetition-free formulas in the same basis

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

The realization of Boolean functions in the class of formulas is studied. The necessary and sufficient condition of Boolean functions representation has been proved by repetition-free formulas in special basis.

Boolean function, repetition-free function, basis, formula

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

IDR: 14835075

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