On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$

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.