46 citations to https://www.mathnet.ru/eng/smj3937
-
A. A. Zapryagaev, “On interpretations of Presburger arithmetic in Büchi arithmetics”, Dokl. Math., 107:2 (2023), 89–92
-
A. L. Semenov, S. F. Soprunov, I. A. Ivanov-Pogodaev, “Creating new mathematics by schoolchildren”, Dokl. Math., 107:Suppl 1 (2023), S132–S136
-
Sanjay Jain, Xiaodong Jia, Ammar Fathin Sabili, Frank Stephan, “Addition machines, automatic functions and open problems of Floyd and Knuth”, Journal of Computer and System Sciences, 136 (2023), 135
-
G. P. Amirdjanov, I. B. Gurevich, F. V. Kostyuk, N. S. Kulberg, T. A. Rudchenko, A. L. Semenov, A. N. Sotnikov, Yu. O. Trusova, A. Yu. Uvarov, V. A. Vardanyan, T. V. Yakovleva, V. V. Yashina, A. S. Zakharova, “The Role of the Scientific Council “Cybernetics” of the USSR Academy of Sciences/the Russian Academy of Sciences in the Development of National Cybernetics and Computer Technology”, Pattern Recognit. Image Anal., 33:4 (2023), 988
-
Seda Albayrak, Jason P. Bell, “Quantitative estimates for the size of an intersection of sparse automatic sets”, Theoretical Computer Science, 977 (2023), 114144
-
A. L. Semenov, S. F. Soprunov, “Lattice of definability (of reducts) for integers with successor”, Izv. Math., 85:6 (2021), 1257–1269
-
Thijmen J. P. Krebs, “A More Reasonable Proof of Cobham's Theorem”, Int. J. Found. Comput. Sci., 32:02 (2021), 203
-
A. L. Semenov, S. F. Soprunov, “The lattice of definability. Origins and directions of research”, Doklady Mathematics (Supplementary issues), 106:2 (2022), 288–298
-
An. A. Muchnik, A. L. Semenov, “Lattice of Definability in the Order of Rational Numbers”, Math. Notes, 108:1 (2020), 94–107
-
Alexis Bès, Christian Choffrut, Lecture Notes in Computer Science, 12038, Language and Automata Theory and Applications, 2020, 128