Babin Dmitry Nikolaevich

Publications in Math-Net.Ru

1. About expressibility of automata with superposition
   
   Intelligent systems. Theory and applications, 27:4 (2023),  76–78
2. On the question of a functional system of automata with a superposition operation
   
   Intelligent systems. Theory and applications, 26:1 (2022),  91–93
3. The classes of automata embeddable to pre-complete classes
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2020, no. 2,  55–57
4. Automata with linear transition functions
   
   Intelligent systems. Theory and applications, 23:3 (2019),  87–95
5. 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
6. Solvability of the problem of completeness of automaton basis depending on its boolean part
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2019, no. 1,  52–54
7. Precomplete classes of automata with the superposition operation
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2018, no. 6,  73–74
8. Класс автоматов с суперпозициями, нерасширяющийся до предполного
   
   Intelligent systems. Theory and applications, 20:4 (2016),  155–166
9. О мультимножестве выходных слов конечного автомата
   
   Intelligent systems. Theory and applications, 20:3 (2016),  101–102
10. Алгоритмически разрешимые случаи в задаче выразимости автоматов относительно суперпозиции
    
    Intelligent systems. Theory and applications, 20:3 (2016),  98–100
11. Chomsky classification for matrices of bigram languages
    
    Intelligent systems. Theory and applications, 20:2 (2016),  331–336
12. Superposition of automata. Set of automata which is not contained in precomplete set
    
    Intelligent systems. Theory and applications, 19:3 (2015),  87–94
13. About superposition capabilities for automata basis containing fixed additive of Boolean functions and delay automaton
    
    Intelligent systems. Theory and applications, 19:3 (2015),  71–78
14. On the classification of bases in $P_k$ according to the decidability of the completeness problem for automata
    
    Fundam. Prikl. Mat., 15:3 (2009),  33–47
15. Математическая модель произнесения команд на основе монотонных вероятностных автоматов
    
    Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2004, no. 2,  52–55
16. Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part
    
    Diskr. Mat., 15:1 (2003),  110–130
17. Finiteness of the set of automaton Post bases with a decidable completeness problem
    
    Diskr. Mat., 10:3 (1998),  57–63
18. On the decidability of the completeness problem for special systems of automata functions
    
    Diskr. Mat., 8:4 (1996),  79–91
19. Undecidability of the completeness and A-completeness problems for some systems of automaton functions
    
    Diskr. Mat., 7:1 (1995),  52–65
20. A decidable case of a problem on the completeness of automaton functions
    
    Diskr. Mat., 4:4 (1992),  41–55
21. Superpositions of bounded-deterministic functions
    
    Mat. Zametki, 47:3 (1990),  3–10
22. Completeness of two-place boundedly deterministic functions with respect to superposition
    
    Diskr. Mat., 1:4 (1989),  86–91
23. Verbal subautomata and the completeness problem
    
    Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1985, no. 3,  82–84