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

This publication is cited in the following articles:

1. E. E. Trifonova, “O bespovtorno zamknutykh klassakh bulevykh funktsii, indutsiruyuschikh nekotorye preobrazovaniya ratsionalnykh veroyatnostei”, Diskret. matem., 37:1 (2025), 119–129    
2. D. V. Kaftan, “Drevesnoe predstavlenie bespovtornykh funktsii v rasshirennykh elementarnykh bazisakh”, Izvestiya vysshikh uchebnykh zavedenii. Povolzhskii region. Fiziko-matematicheskie nauki, 2017, no. 3, 37–49    
3. A. A. Voronenko, V. S. Fedorova, D. V. Chistikov, “Iterated Boolean functions in the elementary basis”, Russian Math. (Iz. VUZ), 55:11 (2011), 61–65      
4. Chistikov D.V., “Testirovanie bespovtornykh funktsii v elementarnom bazise”, Vestnik Moskovskogo universiteta. Seriya 15: Vychislitelnaya matematika i kibernetika, 4 (2011), 37a–40    
5. A. A. Voronenko, D. V. Chistikov, “Learning read once functions using subcube parity queries”, Comput Math Model, 22:1 (2011), 81  
6. Chistikov D.V., “Bespovtornye funktsii s trudnotestiruemymi podfunktsiyami”, Vestn. Mosk. un-ta. Ser. 15: Vychislitelnaya matematika i kibernetika, 2010, no. 4, 38a-41    
7. D. V. Chistikov, “Read-once functions with hard-to-test projections”, MoscowUniv.Comput.Math.Cybern., 34:4 (2010), 188  
8. S. E. Bubnov, A. A. Voronenko, D. V. Chistikov, “Some test length bounds for nonrepeating functions in the {&, ∨} basis”, Comput Math Model, 21:2 (2010), 196  
9. A. A. Voronenko, “Recognizing the nonrepeating property in an arbitrary basis”, Comput Math Model, 18:1 (2007), 55