A characterization of Sturmian words by return words
From MaRDI portal
Publication:5927691
DOI10.1006/eujc.2000.0444zbMath0968.68124OpenAlexW1975206223MaRDI QIDQ5927691
Publication date: 20 March 2001
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/49b0fe107d47931bb36b33723f8aa0743f6cc597
Related Items (46)
Occurrences of palindromes in characteristic Sturmian words ⋮ Generalized balances in Sturmian words ⋮ RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS ⋮ Relation between powers of factors and the recurrence function characterizing Sturmian words ⋮ A geometrical characterization of factors of multidimensional billiard words and some applications ⋮ Computation of critical exponent in balanced sequences ⋮ The index of Sturmian sequences ⋮ Fixed points of Sturmian morphisms and their derivated words ⋮ Episturmian words: a survey ⋮ Squares and cubes in Sturmian sequences ⋮ On Sturmian substitutions closed under derivation ⋮ Reversible Christoffel factorizations ⋮ On minimal critical exponent of balanced sequences ⋮ Abelian periods of factors of Sturmian words ⋮ Abelian combinatorics on words: a survey ⋮ Derived sequences of complementary symmetric Rote sequences ⋮ Hierarchical structures in Sturmian dynamical systems ⋮ On Substitutions Preserving Their Return Sets ⋮ Finite and infinite closed-rich words ⋮ Computing maximal-exponent factors in an overlap-free word ⋮ RECURRENCE FUNCTION OF THE TERNARY THUE-MORSE WORD ⋮ Bifix codes and Sturmian words ⋮ An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence ⋮ A new geometric approach to Sturmian words ⋮ Sturmian words and uncountable set of almost nilpotent varieties of quadratic growth ⋮ Palindromic complexity of codings of rotations ⋮ On generating binary words palindromically ⋮ A coloring problem for infinite words ⋮ Return words in Sturmian and episturmian words ⋮ Sturmian jungle (or garden?) on multiliteral alphabets ⋮ On balanced sequences and their asymptotic critical exponent ⋮ The sequence of return words of the Fibonacci sequence ⋮ Relations on words ⋮ Exchange of three intervals: substitutions and palindromicity ⋮ Words derivated from Sturmian words ⋮ Palindromic factors of billiard words ⋮ Sturmian words and a criterium by Michaux-Villemaire ⋮ Factors of characteristic words: location and decompositions ⋮ A characterization of Sturmian sequences by indistinguishable asymptotic pairs ⋮ Sequences with constant number of return words ⋮ MULTIDIMENSIONAL STURMIAN SEQUENCES AND GENERALIZED SUBSTITUTIONS ⋮ Palindromes in infinite ternary words ⋮ On balanced sequences and their critical exponent ⋮ An estimation of phase transition * ⋮ On closed-rich words ⋮ Asymptotic repetitive threshold of balanced sequences
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Frequencies of factors of Sturmian sequences
- Combinatorics on patterns of a bidimensional Sturmian sequence
- Substitution invariant cutting sequences
- Sturmian morphisms and Rauzy's rules
- On the complexity of infinite sequences
- A characterization of substitutive sequences using return words
- Sturmian words, Lyndon words and trees
- Three distance theorems and combinatorics on words
- Space tilings and substitutions
- The construction of self-similar tilings
- Représentation géométrique de suites de complexité $2n+1$
- Geometric realizations of substitutions
- Dynamics of self-similar tilings
This page was built for publication: A characterization of Sturmian words by return words
