An $S$-adic characterization of minimal subshifts with first difference of complexity $1 \leq p(n+1) - p(n) \leq 2$
From MaRDI portal
Publication:5167707
zbMath1297.68194arXiv1305.0434MaRDI QIDQ5167707
Publication date: 1 July 2014
Full work available at URL: https://arxiv.org/abs/1305.0434
Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10) Symbolic dynamics (37B10)
Related Items
-adic characterization of minimal ternary dendric shifts, An isolated point in the Heinis spectrum, Dynamical properties of minimal Ferenczi subshifts, Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property, On sets of indefinitely desubstitutable words, S-adic Sequences: A Bridge Between Dynamics, Arithmetic, and Geometry, Rigidity and Substitutive Dendric Words, Maximal bifix decoding, Almost everywhere balanced sequences of complexity \(2n + 1\)