177 citations to https://www.mathnet.ru/rus/tm515
-
Т. И. Липина, “Алгоритм распознавания сферической транзитивности
бинарного инициального автомата”, Матем. заметки, 108:5 (2020), 757–763 ; T. I. Lipina, “An Algorithm for Recognizing the Spherical Transitivity of an Initial Binary Automaton”, Math. Notes, 108:5 (2020), 721–726
-
Ahmed E., Savchuk D., “Endomorphisms of Regular Rooted Trees Induced By the Action of Polynomials on the Ring Z(D) of D-Adic Integers”, J. Algebra. Appl., 19:8 (2020), 2050154
-
Donoven C., Olukoya F., “Conjugate Subgroups and Overgroups of V-N”, Int. J. Algebr. Comput., 30:6 (2020), 1129–1160
-
Johansen R., Sorensen A., Szymanski W., “The Polynomial Endomorphisms of Graph Algebras”, Group. Geom. Dyn., 14:3 (2020), 1043–1075
-
D'Angeli D., Rodaro E., Waechter J.Ph., “Automaton Semigroups and Groups: on the Undecidability of Problems Related to Freeness and Finiteness”, Isr. J. Math., 237:1 (2020), 15–52
-
D'Angeli D., Donno A., Rodaro E., “Catalan Fragile Words”, Int. J. Group Theory, 9:2 (2020), 69–80
-
D'Angeli D. Francoeur D. Rodaro E. Waechter J.Ph., “Infinite Automaton Semigroups and Groups Have Infinite Orbits”, J. Algebra, 553 (2020), 119–137
-
Bartholdi L., Mitrofanov I., “The Word and Order Problems For Self-Similar and Automata Groups”, Group. Geom. Dyn., 14:2 (2020), 705–728
-
Skuratovskii R.V., “Employment of Minimal Generating Sets and Structure of Sylow 2-Subgroups Alternating Groups in Block Ciphers”, Advances in Computer Communication and Computational Sciences, Vol 1, Advances in Intelligent Systems and Computing, 759, eds. Bhatia S., Tiwari S., Mishra K., Trivedi M., Springer International Publishing Ag, 2019, 351–364
-
Oliynyk A., Russyev A., “Conjugacy in Finite State Wreath Powers of Finite Permutation Groups”, Algebra Discret. Math., 27:1, SI (2019), 58–69