Some test length bounds for nonrepeating functions in the {&, ∨} basis

Testing relative to a nonrepeating alternative in a conjunction-disjunction basis is considered. A lower bound on the test length is established for all nonrepeating functions in this basis. A subsequence of easily testable functions is constructed and the corresponding tests are described. Individual lower test length bounds are proved for functions of a special form; minimality of the tests is established for the functions of the constructed subsequence.