Recognizability for sequences of morphisms
arXiv:1705.00167 · doi:10.1017/etds.2017.144
Abstract
We investigate different notions of recognizability for a free monoid morphism . Full recognizability occurs when each (aperiodic) point in admits at most one tiling with words , . This is stronger than the classical notion of recognizability of a substitution , where the tiling must be compatible with the language of the substitution. We show that if , or if 's incidence matrix has rank , or if is permutative, then is fully recognizable. Next we investigate the classical notion of recognizability and improve earlier results of Mossé (1992) and Bezuglyi, Kwiatkowski and Medynets (2009), by showing that any substitution is recognizable for aperiodic points in its substitutive shift. Finally we define recognizability and also eventual recognizability for sequences of morphisms which define an -adic shift. We prove that a sequence of morphisms on alphabets of bounded size, such that compositions of consecutive morphisms are growing on all letters, is eventually recognizable for aperiodic points. We provide examples of eventually recognizable, but not recognizable, sequences of morphisms, and sequences of morphisms which are not eventually recognizable. As an application, for a recognizable sequence of morphisms, we obtain an almost everywhere bijective correspondence between the -adic shift it generates, and the measurable Bratteli-Vershik dynamical system that it defines.
Final version
References in corpus (4)
Cited by in corpus (13)
- Symbolic factors of -adic subshifts of finite alphabet rank
- On Topological Rank of Factors of Cantor Minimal Systems
- Dynamical properties of minimal Ferenczi subshifts
- Spectral properties of Schrödinger operators associated to almost minimal substitution systems
- Strong Orbit Equivalence and Superlinear Complexity
- Metallic mean Wang tiles I: self-similarity, aperiodicity and minimality
- On The Dimension Group of Unimodular S-Adic Subshifts
- Measure transfer and -adic developments for subshifts
- Flow views and infinite interval exchange transformations for recognizable substitutions
- Subshifts of finite symbolic rank
- The measure transfer for subshifts induced by a morphism of free monoids
- On the minimal components of substitution subshifts
- Tiling Iterated Function Systems