|
|
|
|
|
 2025 |
| 1. |
S. M. Dudakov, “Problems of algorithmic decidability and axiomatizability of finite subset algebra for binary operations”, Izv. Math., 89:2 (2025), 221–241   |
| 2. |
S. M. Dudakov, “O stepeni nerazreshimosti teorii figur v lineinykh prostranstvakh”, Matematika i teoreticheskie kompyuternye nauki, 2:4 (2025), 51–65  |
| 3. |
S. M. Dudakov, “On theories of the subsets algebra and the subspaces lattice for finite linear spaces”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2025, no. 1, 5–13 |
|
| 2024 |
| 4. |
S. M. Dudakov, “On Finite Subsets Monoid with Decidable Theory”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2024, no. 2, 27–38 |
|
| 2023 |
| 5. |
N. V. Avkhimovich, S. M. Dudakov, “On decidability of finite subsets’ theory for dense linear order”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2023, no. 1, 24–35 |
|
| 2022 |
| 6. |
S. M. Dudakov, “On Undecidability of Finite Subsets Theory for Torsion Abelian Groups”, Mathematics, 10:3 (2022), 533 , 14 pp.   |
| 7. |
S. M. Dudakov, “On Jonsson varieties and quasivarieties”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2022, no. 4, 5–10 |
|
| 2021 |
| 8. |
S. M. Dudakov, B. N. Karlov, “On Decidability of Theories of Regular Languages”, Theory of Computing Systems, 65 (2021), 462–478   |
| 9. |
S. M. Dudakov, “On theory of finite subsets monoid for one torsion abelian group”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2021, no. 2, 39–55 |
| 10. |
S. M. Dudakov, B. N. Karlov, S. L. Kuznetsov, E. M. Fofanova, “Complexity of Lambek calculi with modalities and of total derivability in grammars”, Algebra and Logic, 60:5 (2021), 308–326 |
| 11. |
S. M. Dudakov, “On undecidability of subset theory for some monoids”, International Conference “Applied Mathematics, Computational Science and Mechanics: Current Problems”, AMCSM 2020 (Voronezh, december, 07-09, 2020), Journal of Physics: Conference Series, 1902, 2021, 012060 , 12 pp.  |
|
| 2020 |
| 12. |
S. M. Dudakov, “On definability of one-symbol languages in the monoid of finite languages with concatenation”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2020, no. 4, 5–13 |
| 13. |
S. M. Dudakov, “On Undecidability of Concatenation Theory for One-Symbol Languages”, Lobachevskii Journal of Mathematics, 41:2 (2020), 168–175 |
|
| 2019 |
| 14. |
S. M. Dudakov, “On algorithmic properties of finite subset algebra for some unoids”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2019, no. 4, 108–116 |
| 15. |
S. M. Dudakov, “On computational complexity of successor theory with unary transitive closure”, Journal of Physics: Conference Series, 1202 (2019), 012018 (to appear) , 6 pp. |
| 16. |
S. M. Dudakov, B. N. Karlov, “On Decidability of Regular Languages Theories”, 14th International Computer Science Symposium in Russia, CSR 2019 (Novosibirsk, Russia, July 1–5, 2019), LNCS, 11532, 2019, 119–130 (to appear) |
| 17. |
S. M. Dudakov, “On Safety of Unary and Nonunary IFP Operators”, Automatic Control and Computer Sciences, 53:7 (2019), 683–688 |
|
| 2018 |
| 18. |
S. M. Dudakov, “On safety of unary and non-unary IFP-operators”, Model. Anal. Inform. Sist., 25:5 (2018), 525–533 |
| 19. |
S. M. Dudakov, “On bound of transfinite construction of inflationary fixed point”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2018, no. 3, 72–80 |
|
| 2017 |
| 20. |
S. M. Dudakov, “On expressive power of monadic transitive close logic over discrete order”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2017, no. 4, 25–33 |
|
| 2015 |
| 21. |
S. M. Dudakov, “On inflationary fix-point operators safety”, Lobachevskii Journal of Mathematics, 36:4 (2015), 328–331 |
|
| 2013 |
| 22. |
S. M. Dudakov, “On Safety Of IFP-Operators And Recursive Queries”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2013, no. 2, 5–13 |
| 23. |
D. A. Archangelsky, B. S. Baizhanov, O. V. Belegradek, V. Ya. Belyaev, L. A. Bokut, M. K. Valiev, S. K. Vodopyanov, M. Gitik, Yu. S. Gurevich, D. O. Daderkin, A. M. Dekhtyar, M. I. Dekhtyar, A. Ya. Dikovsky, S. M. Dudakov, E. I. Zelmanov, B. I. Zilber, S. L. Krushkal, S. S. Kutateladze, Yu. V. Matiyasevich, G. E. Mints, I. Kh. Musikaev, A. K. Rebrov, Yu. G. Reshetnyak, A. L. Semenov, A. P. Stolboushkin, I. A. Taimanov, B. A. Trakhtenbrot, “Mikhail Abramovich Taitslin (1936–2013)”, Sib. Èlektron. Mat. Izv., 10 (2013), 54–65 |
|
| 2012 |
| 24. |
S. M. Dudakov, “On safety of recursive queries”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2012, no. 4, 71–80 |
|
| 2011 |
| 25. |
S. M. Dudakov, “Monadic structures over an ordered universal random graph and finite automata”, Izv. Math., 75:5 (2011), 915–932 |
| 26. |
S. M. Dudakov, “Sufficient conditions for effective translation of locally generic queries”, J. Math. Sci., 172:5 (2011), 654–662 |
|
| 2009 |
| 27. |
S. M. Dudakov, “Algorithmic complexity of NP-hard sets”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2009, no. 13, 97–101 |
|
| 2008 |
| 28. |
S. M. Dudakov, “Effective translation of extended $ <$ - invariant formulas in $ <$- bounded”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2008, no. 10, 5–24 |
| 29. |
S. M. Dudakov, “Effective translation of extended $ <$ - invariant formulas in $ <$ -bounded in Semenov arithmetic”, Vestnik TVGU. Ser. Prikl. Matem. [Herald of Tver State University. Ser. Appl. Math.], 2008, no. 8, 65–75 |
|
