51 citations to https://www.mathnet.ru/eng/rm267
-
V. A. Roman'kov, “Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank”, Izv. Math., 87:4 (2023), 798–816
-
A. N. Rybalov, “Generic Complexity of the Word Problem in Some Semigroups”, Algebra Logic, 61:6 (2023), 524
-
M. Rybakov, “Computational complexity of the word problem in modal and pseudo-Boolean algebras
with a small number of generators”, Russian Math. (Iz. VUZ), 66:5 (2022), 33–48
-
V. A. Roman'kov, “Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two”, Sib. elektron. matem. izv., 19:1 (2022), 387–403
-
I. V. Dobrynina, “O podgruppakh v gruppakh Artina s drevesnoi strukturoi”, Chebyshevskii sb., 23:3 (2022), 118–132
-
A. N. Rybalov, “O genericheskoi slozhnosti problemy ravenstva v nekotorykh polugruppakh”, Algebra i logika, 61:6 (2022), 766–783
-
Zbigniew Lipiński, Jolanta Mizera-Pietraszko, Lecture Notes in Computer Science, 13758, Intelligent Information and Database Systems, 2022, 643
-
V. A. Roman'kov, “Algorithmic theory of solvable groups”, PDM, 2021, no. 52, 16–64
-
M. N. Rybakov, “Slozhnost problemy ravenstva slov v mnogoobraziyakh modalnykh algebr”, Vestnik TvGU. Seriya: Prikladnaya matematika, 2021, no. 3, 5–17
-
Nyberg-Brodda C.-F., “The Word Problem For One-Relation Monoids: a Survey”, Semigr. Forum, 103:2 (2021), 297–355