Some improvements of the \(S\)-adic conjecture

DOI10.1016/j.aam.2011.03.005zbMath1247.37012WikidataQ122875138 ScholiaQ122875138MaRDI QIDQ651048

Julien Leroy

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

zbMATH Keywords

factor complexity; \(S\)-adic conjecture; Rauzy graph; special factor

Mathematics Subject Classification ID

68R15: Combinatorics on words

37B10: Symbolic dynamics

11B85: Automata sequences

Related Items

Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm, \(S\)-adic conjecture and Bratteli diagrams, Subword Complexity and Decomposition of the Set of Factors

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