8 citations · 35 across the 15 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
math.DS2024
Limits of Rauzy graphs of languages with subexponential complexity
Paul-Henry Leemann, Tatiana Nagnibeda, Alexandra Skripchenko +1
To a subshift over a finite alphabet, one can naturally associate an infinite family of finite graphs, called its Rauzy graphs. We show that for a subshift of subexponential comple…
math.GR2024
On the structure of finitely generated subgroups of branch groups
Dominik Francoeur, Rostislav Grigorchuk, Paul-Henry Leemann +1
We describe the block structure of finitely generated subgroups of branch groups with the so-called subgroup induction property, including the first Grigorchuk group …