Bel'tyukov Anatoly Petrovich

Publications in Math-Net.Ru

1. Complexity of computations with time travel
   
   Program Systems: Theory and Applications, 16:2 (2025),  3–54
2. Programming in grammars
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 35:2 (2025),  315–334
3. Adaptive human–machine theorem proving system
   
   Izv. IMI UdGU, 64 (2024),  17–33
4. Two-level realization of logical formulas for deductive program synthesis
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 34:4 (2024),  469–485
5. Mutual modeling of sequential and parallel word computations
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 34:2 (2024),  299–308
6. Refinement of the results of recognition of mathematical formulas using the Levenshtein distance
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 30:3 (2020),  513–529
7. Logical analysis of emotions in text from natural language
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 29:1 (2019),  106–116
8. Mathematical model of the photovoltaic converter using the Lambert $W$ function
   
   Izv. IMI UdGU, 2016, no. 2(48),  22–30
9. Interactive realizations of logical formulas
   
   Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 26:2 (2016),  177–193
10. Mathematical modeling of formula images for their recognition
    
    Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2013, no. 1,  153–167
11. Regular expressions in the mathematical text recognition problem
    
    Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2012, no. 2,  63–73
12. About problems of readers and the process of reading in the electronic environment
    
    Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2010, no. 4,  101–111
13. Constructive activities of IT-sphere
    
    Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2009, no. 2,  102–109
14. Simple typed functional programming languages
    
    Vestn. Udmurtsk. Univ. Mat., 2007, no. 1,  223–234
15. Weak constructive second order arithmetic with extracting polynomial time computable algorithms
    
    Zap. Nauchn. Sem. POMI, 304 (2003),  7–12
16. Combined hierarchies of finite random access machines
    
    Zap. Nauchn. Sem. POMI, 277 (2001),  5–13
17. Complexity lower bounds for machine computing models
    
    Zap. Nauchn. Sem. LOMI, 118 (1982),  4–24
18. Hierarchy of complexity of computation of partial functions with values 0 and 1
    
    Mat. Zametki, 28:3 (1980),  423–431
19. A machine description and a hierarchy of initial Grzegorczyk's classes
    
    Zap. Nauchn. Sem. LOMI, 88 (1979),  30–46
20. A maximal sequence of classes transformable by primitive recursion in a given class
    
    Zap. Nauchn. Sem. LOMI, 68 (1977),  3–18
21. Decidability of the universal theory of natural numbers with addition and divisibility
    
    Zap. Nauchn. Sem. LOMI, 60 (1976),  15–28
22. An iterative description of the class $\varepsilon^1$ of Grzegorczyk's hierarchy
    
    Zap. Nauchn. Sem. LOMI, 60 (1976),  3–14


23. Nikolai Nikolaevich Nepeivoda. To anniversary
    
    Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 29:2 (2019),  295–298
24. In memory of Galimzyan Gazizovich Islamov (02.02.1948–22.11.2017)
    
    Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 27:4 (2017),  634–642