On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\,\vee,\neg\}$
Diskretnaya Matematika, Tome 17 (2005) no. 2, pp. 139-143
Cet article a éte moissonné depuis la source Math-Net.Ru
In this paper, we present upper and lower linear bounds for the Shannon function for length of checking tests for repetition-free functions in the basis $\{0,1,\,\vee,\neg\}$. The research was supported by Russian Foundation for Basic Research, grants 04–01–00359 and 05–01–01000.
@article{DM_2005_17_2_a10,
author = {A. A. Voronenko},
title = {On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$},
journal = {Diskretnaya Matematika},
pages = {139--143},
year = {2005},
volume = {17},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2005_17_2_a10/}
}
A. A. Voronenko. On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$. Diskretnaya Matematika, Tome 17 (2005) no. 2, pp. 139-143. http://geodesic.mathdoc.fr/item/DM_2005_17_2_a10/
[1] Voronenko A. A., “O proveryayuschikh testakh dlya bespovtornykh funktsii”, Matem. voprosy kibernetiki, 11 (2002), 163–176 | MR
[2] Kuznetsov A. V., “O bespovtornykh kontaktnykh skhemakh i bespovtornykh superpozitsiyakh funktsii algebry logiki”, Tr. MIAN, 51, 1958, 186–225 | Zbl
[3] Voronenko A. A., “Ob otsenke dliny proveryayuschego testa dlya nekotorykh bespovtornykh funktsii”, Prikl. matem. i informatika, 15 (2003), 85–97