Minimal verifying tests of functions from the Post classes
Diskretnaya Matematika, Tome 5 (1993) no. 2, pp. 75-82
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We study the behavior of the function $L(f)$ that is equal to the minimally sufficient number of sets forming a checking test for a Boolean function $f$ with respect to single constant errors in the case when the functions $f$ belong to Post classes. We indicate the possible values of $L(f)$ for various functions $f$ of each Post class.