Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Babin, Dmitry Nikolaevich
Professor
Doctor of physico-mathematical sciences (1999)
Speciality: 01.01.09 (Discrete mathematics and mathematical cybernetics)
Birth date: 2.09.1954
E-mail:
Website: https://www.intsys.msu.ru, http://babin@http://intsys.msu.ru
Keywords: finite automata.
UDC: 519.7, 519.95

Subject:

Computer science.
   
Main publications:
  1. Babin D.N., “On the Classification of Automaton Bases”, Doklady Mathematics, 60:1 (1999), 65–67  mathscinet  zmath
  2. Babin D.N., “O klassifikatsii avtomatnykh bazisov Posta po razreshimosti svoistv polnoty i A-polnoty”, DOKLADY AKADEMII NAUK, 367:4 (1999), 439–441  mathscinet  zmath
  3. Babin D.N., “O polnote dvumestnykh o.-d. funktsii otnositelno superpozitsii”, Diskretnaya matematika, 1:4 (1989), 86–91  mathnet  mathscinet  zmath
  4. Babin D.N., “O klassifikatsii bazisov v $P_k$ po razreshimosti zadachi polnoty konechnykh sistem avtomatov”, Intellektualnye sistemy, 10 (2007), 369–389

https://www.mathnet.ru/eng/person27958
List of publications on Google Scholar
https://mathscinet.ams.org/mathscinet/MRAuthorID/224896

Publications in Math-Net.Ru Citations
2023
1. D. N. Babin, A. A. Letunovskii, “About expressibility of automata with superposition”, Intelligent systems. Theory and applications, 27:4 (2023),  76–78  mathnet
2022
2. D. N. Babin, “On the question of a functional system of automata with a superposition operation”, Intelligent systems. Theory and applications, 26:1 (2022),  91–93  mathnet
2020
3. D. N. Babin, V. B. Kudryavtsev, “The classes of automata embeddable to pre-complete classes”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2020, no. 2,  55–57  mathnet  mathscinet  zmath; Moscow University Mathematics Bulletin, 75:2 (2020), 87–89  isi  scopus 1
2019
4. D. N. Babin, “Automata with linear transition functions”, Intelligent systems. Theory and applications, 23:3 (2019),  87–95  mathnet 4
5. V. B. Kudryavtsev, D. N. Babin, “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  mathnet
6. D. N. Babin, “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  mathnet  mathscinet  zmath; Moscow University Mathematics Bulletin, 74:1 (2019), 32–34  isi  scopus
2018
7. D. N. Babin, “Precomplete classes of automata with the superposition operation”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2018, no. 6,  73–74  mathnet  mathscinet  zmath; Moscow University Mathematics Bulletin, 73:6 (2018), 269–270  isi  scopus
2016
8. D. N. Babin, “Класс автоматов с суперпозициями, нерасширяющийся до предполного”, Intelligent systems. Theory and applications, 20:4 (2016),  155–166  mathnet 1
9. D. N. Babin, D. V. Parkhomenko, “О мультимножестве выходных слов конечного автомата”, Intelligent systems. Theory and applications, 20:3 (2016),  101–102  mathnet 2
10. D. N. Babin, A. A. Letunovskii, “Алгоритмически разрешимые случаи в задаче выразимости автоматов относительно суперпозиции”, Intelligent systems. Theory and applications, 20:3 (2016),  98–100  mathnet 1
11. A. A. Petyushko, D. N. Babin, “Chomsky classification for matrices of bigram languages”, Intelligent systems. Theory and applications, 20:2 (2016),  331–336  mathnet
2015
12. D. N. Babin, “Superposition of automata. Set of automata which is not contained in precomplete set”, Intelligent systems. Theory and applications, 19:3 (2015),  87–94  mathnet
13. D. N. Babin, A. A. Letunovskii, “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  mathnet 1
2009
14. D. N. Babin, “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  mathnet  mathscinet; J. Math. Sci., 168:1 (2010), 21–31  scopus 2
2004
15. D. N. Babin, I. L. Mazurenko, “Математическая модель произнесения команд на основе монотонных вероятностных автоматов”, Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2004, no. 2,  52–55  mathnet
2003
16. D. N. Babin, “Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part”, Diskr. Mat., 15:1 (2003),  110–130  mathnet  mathscinet  zmath; Discrete Math. Appl., 13:1 (2003), 63–84 1
1998
17. D. N. Babin, “Finiteness of the set of automaton Post bases with a decidable completeness problem”, Diskr. Mat., 10:3 (1998),  57–63  mathnet  mathscinet  zmath; Discrete Math. Appl., 8:5 (1998), 475–482 2
1996
18. D. N. Babin, “On the decidability of the completeness problem for special systems of automata functions”, Diskr. Mat., 8:4 (1996),  79–91  mathnet  mathscinet  zmath; Discrete Math. Appl., 6:5 (1996), 491–504 2
1995
19. D. N. Babin, “Undecidability of the completeness and A-completeness problems for some systems of automaton functions”, Diskr. Mat., 7:1 (1995),  52–65  mathnet  mathscinet  zmath; Discrete Math. Appl., 5:1 (1995), 31–42 1
1992
20. D. N. Babin, “A decidable case of a problem on the completeness of automaton functions”, Diskr. Mat., 4:4 (1992),  41–55  mathnet  mathscinet  zmath 10
1990
21. D. N. Babin, “Superpositions of bounded-deterministic functions”, Mat. Zametki, 47:3 (1990),  3–10  mathnet  mathscinet  zmath; Math. Notes, 47:3 (1990), 231–235  isi 2
1989
22. D. N. Babin, “Completeness of two-place boundedly deterministic functions with respect to superposition”, Diskr. Mat., 1:4 (1989),  86–91  mathnet  mathscinet  zmath; Discrete Math. Appl., 1:4 (1991), 423–431 18
1985
23. D. N. Babin, “Verbal subautomata and the completeness problem”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1985, no. 3,  82–84  mathnet  mathscinet  zmath 2

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024