Kudryavtsev Valerii Borisovich

Publications in Math-Net.Ru

1. On the complexity of a linear ordering of weighted directed acyclic graphs
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 1,  55–57
2. Artificial intelligence: problems and prospects
   
   Intelligent systems. Theory and applications, 24:4 (2020),  33–44
3. On irreduceability of Boolean functions with respect to commutative associative operation
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2020, no. 4,  51–53
4. The classes of automata embeddable to pre-complete classes
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2020, no. 2,  55–57
5. On stabilization of an automaton model of migration processes
   
   Diskr. Mat., 31:1 (2019),  56–71
6. Classification of bases in $P_k$ by the property of decidability of the completeness for automata
   
   Intelligent systems. Theory and applications, 23:1 (2019),  137–145
7. On the properties of languages that are stable to the drop/paste operations
   
   Intelligent systems. Theory and applications, 22:4 (2018),  153–167
8. On the semantic analysis of juridical documents
   
   Intelligent systems. Theory and applications, 22:3 (2018),  45–88
9. Reconstruction of automata by fragments of behaviour
   
   Diskr. Mat., 21:2 (2009),  3–42
10. Analysis of behaviour of automata
    
    Diskr. Mat., 21:1 (2009),  3–35
11. Modeling learning process
    
    Fundam. Prikl. Mat., 15:5 (2009),  111–169
12. Analysis and synthesis of abstract automata
    
    Fundam. Prikl. Mat., 15:4 (2009),  101–175
13. Test recognition
    
    Fundam. Prikl. Mat., 15:4 (2009),  67–99
14. Automata algebras
    
    Fundam. Prikl. Mat., 15:4 (2009),  37–66
15. On algorithm complexity
    
    Fundam. Prikl. Mat., 15:3 (2009),  135–181
16. The Conference “Intelligent Systems and Computer Science”
    
    Fundam. Prikl. Mat., 15:3 (2009),  3
17. Test recognition theory
    
    Diskr. Mat., 18:3 (2006),  3–34
18. Collectives of automata in labyrinths
    
    Diskr. Mat., 15:3 (2003),  3–39
19. Independent systems of automata in labyrinths
    
    Diskr. Mat., 15:2 (2003),  3–39
20. On the automaton model of the learning process
    
    Diskr. Mat., 8:4 (1996),  3–10
21. On the automata functional systems
    
    Diskr. Mat., 7:4 (1995),  3–28
22. Sergei Vsevolodovich Yablonskii (on his 70th birthday)
    
    Sibirsk. Zh. Issled. Oper., 1:4 (1994),  3–6
23. The behavior of automata in labyrinths
    
    Diskr. Mat., 4:3 (1992),  3–28
24. Fundamental directions in the theory of homogeneous structures
    
    Diskr. Mat., 1:3 (1989),  19–38
25. On completeness for function systems
    
    Dokl. Akad. Nauk SSSR, 257:2 (1981),  274–278
26. Concerning the functional system $\mathscr P_\Sigma$
    
    Zh. Vychisl. Mat. Mat. Fiz., 14:1 (1974),  198–208
27. On the functional system $\mathscr{P}_\Sigma$
    
    Dokl. Akad. Nauk SSSR, 210:3 (1973),  521–522
28. On basic groups in $k$-valued logics
    
    Dokl. Akad. Nauk SSSR, 201:1 (1971),  9–11
29. On $S$-systems of functions of $k$-valued logic
    
    Dokl. Akad. Nauk SSSR, 199:1 (1971),  20–22
30. Precomplete classes in $k$-valued logics
    
    Dokl. Akad. Nauk SSSR, 186:3 (1969),  509–512
31. The powers of sets of precomplete classes of certain functionals of systems related to automata
    
    Dokl. Akad. Nauk SSSR, 151:3 (1963),  493–496
32. Completeness theorem for a class of automata without feedback couplings
    
    Dokl. Akad. Nauk SSSR, 132:2 (1960),  272–274
33. Problems of completeness for automatic machine systems
    
    Dokl. Akad. Nauk SSSR, 130:6 (1960),  1189–1192


34. Валентин Федорович Колчин (1934–2016)
    
    Diskr. Mat., 28:4 (2016),  3–5
35. Yurii Vasil'evich Prokhorov (on the occasion of his eightieth birthday)
    
    Diskr. Mat., 22:1 (2010),  3–4
36. Sergei Vsevolodovich Yablonskii (1924–1998)
    
    Diskr. Mat., 11:1 (1999),  151–157
37. Поправки к статье "О предполных классах в $k$-значных логиках" (ДАН, т. 186, № 3, 1969)
    
    Dokl. Akad. Nauk SSSR, 199:1 (1971),  90