Author:
Bartholdi Laurent,Noce Marialaura
Abstract
AbstractWe study the portraits of isometries of rooted trees—the labelling of the tree, at each vertex, by the permutation of its descendants—in terms of languages. We characterize regularly branched self-similar groups in terms of $$\omega $$
ω
-regular languages. We deduce the algorithmic decidability of some problems, such as the comparison of regularly branched contracting groups, and their orbit structure on the boundary of the rooted tree.
Funder
Università degli Studi di Salerno
Publisher
Springer Science and Business Media LLC
Reference27 articles.
1. Abercrombie, A.G.: Subgroups and subrings of profinite rings. Math. Proc. Camb. Philos. Soc. 116(2), 209–222 (1994). https://doi.org/10.1017/S0305004100072522
2. Anīsīmov, A.V.: The group languages. Kibernetika (Kiev) 4, 18–24 (1971)
3. Bartholdi, L.: Branch rings, thinned rings, tree enveloping rings. Israel J. Math. 154, 200410 (2006)
4. Bartholdi, L., Siegenthaler, O.: The twisted twin of the Grigorchuk group. Int. J. Algebra Comput. 20(04), 465–488 (2010)
5. Bartholdi, L., Grigorchuk, R.I., Sunik, Z.: Branch groups. In: Handbook of Algebra, vol. 3, pp. 989–1112. North-Holland, Amsterdam (2003)