Some improvements of the \(S\)-adic conjecture
From MaRDI portal
Publication:651048
DOI10.1016/j.aam.2011.03.005zbMath1247.37012OpenAlexW2153295092WikidataQ122875138 ScholiaQ122875138MaRDI QIDQ651048
Publication date: 8 December 2011
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aam.2011.03.005
Related Items (8)
-adic characterization of minimal ternary dendric shifts ⋮ Subword Complexity and Decomposition of the Set of Factors ⋮ On sets of indefinitely desubstitutable words ⋮ A characterization of words of linear complexity ⋮ Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm ⋮ S-adic Sequences: A Bridge Between Dynamics, Arithmetic, and Geometry ⋮ \(S\)-adic conjecture and Bratteli diagrams ⋮ Rigidity and Substitutive Dendric Words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Substitutions in dynamics, arithmetics and combinatorics
- Subword complexities of various classes of deterministic developmental languages without interactions
- On the number of subwords of everywhere growing DTOL languages
- Complexity and special factors
- Conjugacy and episturmian morphisms.
- Complexité des facteurs des mots infinis engendrés par morphismes itérés
- Initial powers of Sturmian sequences
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Représentation géométrique de suites de complexité $2n+1$
- Automatic Sequences
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- Les transformations de Chacon : combinatoire, structure géométrique, lien avec les systèmes de complexité $2n+1$
- Rank and symbolic complexity
- Uniform tag sequences
- On the numeration system of Ostrowski
This page was built for publication: Some improvements of the \(S\)-adic conjecture
