[HTML][HTML] Tree shift topological entropy
K Petersen, I Salama - Theoretical Computer Science, 2018 - Elsevier
Tree shift topological entropy - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Search RegisterSign in View PDF Download full issue Search …
Journals & Books Search RegisterSign in View PDF Download full issue Search …
Entropy on regular trees
K Petersen, I Salama - arXiv preprint arXiv:1909.05153, 2019 - arxiv.org
We show that the limit in our definition of tree shift topological entropy is actually the infimum,
as is the case for both the topological and measure-theoretic entropies in the classical …
as is the case for both the topological and measure-theoretic entropies in the classical …
Uniform sampling of subshifts of finite type on grids and trees
J Mairesse, I Marcovici - International Journal of Foundations of …, 2017 - World Scientific
Let us color the vertices of the grid ℤd or the infinite regular tree 𝕋d, using a finite number of
colors, with the constraint that some predefined pairs of colors are not allowed for adjacent …
colors, with the constraint that some predefined pairs of colors are not allowed for adjacent …
On the stability and shadowing of tree-shifts of finite type
D Bucki - Proceedings of the American Mathematical Society, 2024 - ams.org
We investigate relations between the pseudo-orbit-tracing property, topological stability and
openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the …
openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the …
[HTML][HTML] A language hierarchy and Kitchens-type theorem for self-similar groups
A Penland, Z Šunić - Journal of Algebra, 2019 - Elsevier
We generalize the notion of self-similar groups of infinite tree automorphisms to allow for
groups which are defined on a tree but may not act faithfully on it. The elements of such a …
groups which are defined on a tree but may not act faithfully on it. The elements of such a …
Dynamique symbolique des systèmes 2D et des arbres infinis
N Aubrun - 2011 - pastel.hal.science
Cette thèse est consacrée à l'étude des décalages, ou encore systèmes dynamiques
symboliques, définis sur certains monoïdes finiment présentés, ℤ^ d d'une part et les arbres …
symboliques, définis sur certains monoïdes finiment présentés, ℤ^ d d'une part et les arbres …
Nearly Maximal Hausdorff Dimension in Finitely Constrained Groups
A Penland - arXiv preprint arXiv:1710.05261, 2017 - arxiv.org
This work continues the study of the properties of finitely constrained groups of binary tree
automorphisms in terms of their Hausdorff dimension. We prove that there are exactly …
automorphisms in terms of their Hausdorff dimension. We prove that there are exactly …