Abstract
is shown that if weakly repetitive functions are added to an elementary base, the Shannon function for the length of each test with respect to a read-once alternative remains linear.
Similar content being viewed by others
REFERENCES
V. B. Alekseev, Lectures on Discrete Mathematics. A Tutorial (Infra-M, Moscow, 2012) [in Russian].
A. A. Voronenko, ‘‘On verifying tests for read-once functions,’’ Mat. Vopr. Kibern., No. 11, 165–176 (2002).
C. E. Shannon, ‘‘A symbolic analysis of relay and switching circuits,’’ Trans. Am. Inst. Electr. Eng. 57 (12), 713–723 (1938).
D. F. Kaftan, ‘‘Testing nonrepeated functions in a median extended elementary basis,’’ Prikl. Mat. Inf., No. 66, 104–110 (2021).
V. A. Stetsenko, ‘‘On premaximal bases in \(P_{2}\),’’ Mat. Vopr. Kibern., No. 4, 139–177 (1992).
N. A. Peryazev, ‘‘On realization of Boolean functions by formulae without repetitions,’’ Discrete Math. Appl. 5 (4), 347–356 (2009).
D. V. Kaftan, ‘‘Tree representation of read-once functions in extended elementary bases,’’ Izv. Vyssh. Uchebn. Zaved., Povolzh. Reg., Fiz.-Mat. Nauki, No. 3 (43), 37–49 (2017).
A. A. Voronenko, ‘‘On testing repetition-free functions,’’ Moscow Univ. Comput. Math. Cybern. 30 (2), 47–50 (2006).
Lecture Notes by O. B. Lupanov on the Course ‘‘Introduction to Mathematical Logic’’, Ed. by A. B. Ugol’nikov (Izd. Tsentra Prikl. Issled. Mekh.-Mat. Fak. Mosk. Gos. Univ., Moscow, 2007) [in Russian].
A. A. Voronenko, ‘‘On the length of checking test for repetition-free functions in the basis \(\{0,1,\&,\vee,\neg{}\}\),’’ Discrete Math. Appl. 15 (3), 313–318 (2005).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated by A. Muravnik
About this article
Cite this article
Kaftan, D.V. Testing of Read-Once Functions in Extended Elementary Bases. MoscowUniv.Comput.Math.Cybern. 45, 96–102 (2021). https://doi.org/10.3103/S0278641921030018
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0278641921030018