RUS  ENG
Full version
JOURNALS // Sibirskii Matematicheskii Zhurnal // Archive
Sibirsk. Mat. Zh., 2009 Volume 50, Number 1, Pages 231–237 (Mi smj1952)
This article is cited in 2 papers

Realization of Boolean functions by repetition-free formulas in a particular base

I. K. Sharankhaev

Buryat State University, Institute for Mathematics and Informatics

Abstract: Under study are the representations of Boolean functions by formulas. We offer a criterion for the Boolean functions to be repetition-free in the base $\{\vee,\cdot,-,0,1,x_1(x_2\vee x_3x_4)\vee x_5(x_3\vee x_2x_4)\}$.

Keywords: Boolean function, formula, base, repetition-free function, weak-repetition function, almost elementary base.

UDC: 519.71

Received: 07.07.2007


 English version: Siberian Mathematical Journal, 2009, 50:1, 188–192

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025