Return words in Sturmian and episturmian words
From MaRDI portal
Publication:2720407
DOI10.1051/ita:2000121zbMath0987.68055OpenAlexW2016338222MaRDI QIDQ2720407
Laurent Vuillon, Jacques Justin
Publication date: 26 June 2001
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/222053
Related Items (45)
Occurrences of palindromes in characteristic Sturmian words ⋮ Palindromic language of thin discrete planes ⋮ RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS ⋮ On a generalization of Christoffel words: epichristoffel words ⋮ Closed Ziv-Lempel factorization of the \(m\)-bonacci words ⋮ On the number of partitions of an integer in the \(m\)-bonacci base ⋮ Powers in a class of \(\mathcal A\)-strict standard episturmian words ⋮ Enumeration Formulæ in Neutral Sets ⋮ Quasiperiodic and Lyndon episturmian words ⋮ COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS ⋮ Episturmian words: a survey ⋮ Squares and cubes in Sturmian sequences ⋮ Dejean's conjecture and Sturmian words ⋮ Zero-measure Cantor spectrum for Schrödinger operators with low-complexity potentials ⋮ Reversible Christoffel factorizations ⋮ Abelian periods of factors of Sturmian words ⋮ Derived sequences of complementary symmetric Rote sequences ⋮ Conjugacy and episturmian morphisms. ⋮ Hierarchical structures in Sturmian dynamical systems ⋮ Critical Exponents of Regular Arnoux-Rauzy Sequences ⋮ On non-repetitive complexity of Arnoux-Rauzy words ⋮ Some properties of the \(k\)-bonacci words on infinite alphabet ⋮ Bifix codes and Sturmian words ⋮ A new geometric approach to Sturmian words ⋮ Recent results on syntactic groups of prefix codes. ⋮ Palindromic complexity of codings of rotations ⋮ On generating binary words palindromically ⋮ Sturmian jungle (or garden?) on multiliteral alphabets ⋮ Interval exchanges, admissibility and branching Rauzy induction ⋮ Characterizations of finite and infinite episturmian words via lexicographic orderings ⋮ Morphic images of episturmian words having finite palindromic defect ⋮ A characterization of fine words over a finite alphabet ⋮ The finite index basis property ⋮ Bifix codes and interval exchanges ⋮ A condition of Boshernitzan and uniform convergence in the multiplicative ergodic theorem ⋮ Neutral and tree sets of arbitrary characteristic ⋮ A characterization of Sturmian sequences by indistinguishable asymptotic pairs ⋮ Maximal bifix decoding ⋮ On \(\theta\)-episturmian words ⋮ Palindromic richness ⋮ Sequences with constant number of return words ⋮ Some algorithms to compute the conjugates of Episturmian morphisms ⋮ Acyclic, connected and tree sets ⋮ GAPS IN THE THUE–MORSE WORD ⋮ Episturmian words and episturmian morphisms
Cites Work
- A characterization of substitutive sequences using return words
- Sturmian words: structure, combinatorics, and their arithmetics
- Episturmian words and episturmian morphisms
- Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution
- Transcendence of Sturmian or morphic continued fractions
- Generalized balances in Sturmian words
- Représentation géométrique de suites de complexité $2n+1$
- Geometric realizations of substitutions
- Symbolic Dynamics II. Sturmian Trajectories
- A characterization of Sturmian words by return words
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: Return words in Sturmian and episturmian words
