RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive
Diskr. Mat., 1995 Volume 7, Issue 3, Pages 61–68 (Mi dm588)
This article is cited in 7 papers

Realization of Boolean functions by nonrepetitive formulas

N. A. Peryazev


Abstract: We give a characterization of Boolean functions realized by formulae without repetitions in the basis $\{\cdot ,\lor, \oplus ,\bar{\space}\, \}$ and suggest an algorithm for finding such realizations.

UDC: 519.71

Received: 27.10.1992
Revised: 20.12.1993


 English version: Discrete Mathematics and Applications, 1995, 5:4, 347–355

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025