Chasovskikh Anatolii Aleksandrovich

Publications in Math-Net.Ru

1. Minimal universal elements in the class of neural circuits
   
   Diskr. Mat., 37:4 (2025),  130–144
2. MaTIS – the school of V.B. Kudryavtsev: traditions and advancement
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2024, no. 6,  15–26
3. Automation of artificial neural network architectures search
   
   Intelligent systems. Theory and applications, 27:4 (2023),  5–27
4. Feedback connection in recurrent circuits
   
   Intelligent systems. Theory and applications, 26:4 (2022),  51–74
5. Linear automata classes over finite fields with superposition operations
   
   Intelligent systems. Theory and applications, 25:4 (2021),  221–224
6. Linear $p$-automata classes with superposition operations
   
   Intelligent systems. Theory and applications, 25:2 (2021),  155–156
7. Maximum subclasses in classes of linear automata over finite fields
   
   Diskr. Mat., 31:4 (2019),  88–101
8. On classes of transfer functions of linear automata
   
   Intelligent systems. Theory and applications, 23:3 (2019),  135–142
9. On the number of maximum overclasses in the linear automata class
   
   Intelligent systems. Theory and applications, 23:3 (2019),  81–84
10. Reduced criterial system of are precomplete classes in linear automata classes over finite fields
    
    Intelligent systems. Theory and applications, 22:4 (2018),  115–135
11. The problem of completeness in the class of linear automata
    
    Intelligent systems. Theory and applications, 22:2 (2018),  151–153
12. Reports from the Automata Theory seminar
    
    Intelligent systems. Theory and applications, 22:2 (2018),  125–128
13. О полноте в классе линейных 2-адических автоматов
    
    Intelligent systems. Theory and applications, 20:4 (2016),  209–227
14. О быстродействии сетей из нейронов Мак-Каллока–Питтса
    
    Intelligent systems. Theory and applications, 20:3 (2016),  169–174
15. Уравнение операторов замыкания в классе линейно-автоматных функций
    
    Intelligent systems. Theory and applications, 20:3 (2016),  120–125
16. Completeness problem for the class of linear automata functions
    
    Diskr. Mat., 27:2 (2015),  134–151
17. Criterial systems in classes of linear automaton functions over finite fields
    
    Intelligent systems. Theory and applications, 19:3 (2015),  195–207
18. Automaton complexity of two-place Boolean bases
    
    Diskr. Mat., 8:4 (1996),  123–133
19. Complexity of automata that compute the values of formulas
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1996, no. 4,  22–24
20. On the expressibility of systems with an adder in the class of linear-automaton functions
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1990, no. 4,  31–34
21. Algorithmic solvability of the completeness problem for linear automata
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1986, no. 3,  82–84


22. Opportunities for the implementation of automatic learning system
    
    Intelligent systems. Theory and applications, 26:4 (2022),  5–19
23. Kolmogorov School Readings
    
    Math. Ed., 2006, no. 2(37),  70–73