Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property

DOI10.1142/S0129054119400082zbMath1415.68138arXiv1808.02680OpenAlexW2887248023MaRDI QIDQ5384436

Gwenaël Richomme

Publication date: 24 June 2019

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.02680

zbMATH Keywords

morphisms\(S\)-adicitygeneralizations of Sturmian words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (1)

On sets of indefinitely desubstitutable words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factor complexity of \(S\)-adic words generated by the Arnoux-Rauzy-Poincaré algorithm
• Special factors and the combinatorics of suffix and factor automata
• Substitutions in dynamics, arithmetics and combinatorics
• Quasiperiodic Sturmian words and morphisms
• Conjugacy and episturmian morphisms.
• Episturmian words and episturmian morphisms
• A characterization of infinite LSP words
• Initial powers of Sturmian sequences
• Représentation géométrique de suites de complexité $2n+1$
• Rank and symbolic complexity
• An $S$-adic characterization of minimal subshifts with first difference of complexity $1 \leq p(n+1) - p(n) \leq 2$
• Beyond substitutive dynamical systems: S-adic expansions
• Suffix Automata and Standard Sturmian Words
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Characterization of Infinite LSP Words and Endomorphisms Preserving the LSP Property