178 citations to https://www.mathnet.ru/rus/tm515
-
Woryna A., “The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet”, Inf. Comput., 249 (2016), 18–27
-
Lavrenyuk Ya., “The group of all finite-state automorphisms of a regular rooted tree has a minimal generating set”, Geod. Dedic., 183:1 (2016), 59–67
-
Savchuk D.M., Sidki S.N., “Affine automorphisms of rooted trees”, Geod. Dedic., 183:1 (2016), 195–213
-
Grigorchuk R. Leonov Y. Nekrashevych V. Sushchansky V., “Self-similar groups, automatic sequences, and unitriangular representations”, Bull. Math. Sci., 6:2 (2016), 231–285
-
Grigorchuk R., Leemann P.-H., Nagnibeda T., “Lamplighter groups, de Brujin graphs, spider-web graphs and their spectra”, J. Phys. A-Math. Theor., 49:20 (2016), 205004
-
Klimann I., “Automaton Semigroups: The Two-state Case”, Theor. Comput. Syst., 58:4 (2016), 664–680
-
Bier A., Leshchenko Yu., Sushchanskyy V., “Automorphisms of restricted parabolic trees and Sylow p-subgroups of the finitary symmetric group”, J. Algebra, 452 (2016), 401–426
-
Dimitrijevs M., Cipola K., “Ultrametric Finite Automata and Their Capabilities”, Balt. J. Mod. Comput., 4:4 (2016), 896–909
-
Bajorska B., “Factorizations of Self-similar Groups Associated to the First Grigorchuk Group”, Commun. Algebr., 44:11 (2016), 5004–5026
-
Bondarenko I., D'Angeli D., Rodaro E., “The Lamplighter Group _{3} Generated by a Bireversible Automaton”, Commun. Algebr., 44:12 (2016), 5257–5268