A characterization of Sturmian words by return words
From MaRDI portal
Publication:5927691
DOI10.1006/eujc.2000.0444zbMath0968.68124MaRDI 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
68R15: Combinatorics on words
Related Items
RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS, Episturmian words: a survey, Squares and cubes in Sturmian sequences, MULTIDIMENSIONAL STURMIAN SEQUENCES AND GENERALIZED SUBSTITUTIONS, Reversible Christoffel factorizations, A new geometric approach to Sturmian words, On generating binary words palindromically, The sequence of return words of the Fibonacci sequence, Sturmian words and a criterium by Michaux-Villemaire, Palindromic complexity of codings of rotations, Occurrences of palindromes in characteristic Sturmian words, Relation between powers of factors and the recurrence function characterizing Sturmian words, Computing maximal-exponent factors in an overlap-free word, Factors of characteristic words: location and decompositions, Sequences with constant number of return words, The index of Sturmian sequences, Hierarchical structures in Sturmian dynamical systems, Generalized balances in Sturmian words, Bifix codes and Sturmian words, A geometrical characterization of factors of multidimensional billiard words and some applications, A coloring problem for infinite words, Words derivated from Sturmian words, Palindromic factors of billiard words, Return words in Sturmian and episturmian words, Sturmian jungle (or garden?) on multiliteral alphabets, Palindromes in infinite ternary words
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
