Algorithmic Decidability of Engel???s Property for Automaton Groups, Proceedings, pp.29-40, 2016. ,
DOI : 10.1007/978-3-319-34171-2_3
On the conjugacy problem for finite-state automorphisms of regular rooted trees, Groups Geom, Dyn, vol.7, issue.2, pp.323-355, 2013. ,
Finite-state self-similar actions of nilpotent groups, Geometriae Dedicata, vol.336, issue.1, pp.339-348, 2013. ,
DOI : 10.1007/s10711-012-9752-y
Automaton semigroups, Theoretical Computer Science, vol.410, issue.47-49, pp.5022-5038, 2009. ,
DOI : 10.1016/j.tcs.2009.07.054
Boundary action of automaton groups without singular points and Wang tilings, p.7736, 1604. ,
Knapsack problems in products of groups, Journal of Symbolic Computation, vol.74, pp.96-108, 2016. ,
DOI : 10.1016/j.jsc.2015.05.006
Abstract theory of automata, Uspehi Mat, Nauk, vol.165, issue.5101, pp.3-62, 1961. ,
Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups, 41st International Symposium on Mathematical Foundations of Computer Science LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.441-4414, 2016. ,
On torsion-free semigroups generated by invertible reversible Mealy automata, Language and Automata Theory and Applications -9th International Conference, Proceedings (Adrian Horia Dediu, pp.328-339, 2015. ,
On Burnside's problem on periodic groups, Funktsional. Anal. i Prilozhen On the Milnor problem of group growth, Dokl. Akad. Nauk SSSR, vol.12, issue.271 1, pp.14-15, 1980. ,
Automaton Semigroups: The Two-state Case, Theor. Comput. Syst. (special issue STACS'13), pp.1-17, 2014. ,
DOI : 10.1007/s00224-014-9594-0
A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group, Proceedings. (Igor Potapov, pp.313-325, 2015. ,
DOI : 10.1007/978-3-319-21500-6_25
Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups, ArXiv e-prints, 2015. ,
Knapsack in graph groups, HNN-extensions and amalgamated products, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 LIPIcs Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.501-5014, 2016. ,
Combinatorial group theory, Classics in Mathematics, vol.89, 2001. ,
DOI : 10.1007/978-3-642-61896-3
Self-similar groups, Mathematical Surveys and Monographs, vol.117, 2005. ,
DOI : 10.1090/surv/117
Automorphisms of one-rooted trees: Growth, circuit structure, and acyclicity, Journal of Mathematical Sciences, vol.68, issue.No. 2, pp.1925-1943, 2000. ,
DOI : 10.1007/BF02677504
AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK, International Journal of Algebra and Computation, vol.21, issue.01n02, pp.329-354, 2011. ,
DOI : 10.1142/S0218196711006194
The conjugacy problem in automaton groups is not solvable, Journal of Algebra, vol.364, pp.148-154, 2012. ,
DOI : 10.1016/j.jalgebra.2012.04.014
On a free group of transformations defined by an automaton, Geometriae Dedicata, vol.100, issue.1, pp.237-249, 2007. ,
DOI : 10.1007/s10711-006-9060-5