Sequences with constant number of return words
From MaRDI portal
Recommendations
Cites work
- A characterization of Sturmian words by return words
- A characterization of substitutive sequences using return words
- Complexity and special factors
- Complexity of infinite words associated with beta-expansions
- Les transformations de Chacon : combinatoire, structure géométrique, lien avec les systèmes de complexité 2n+1
- On a class of infinite words with affine factor complexity
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
- Return words in Sturmian and episturmian words
- Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories
- Substitution dynamical systems - spectral analysis
- Substitution dynamical systems : algebraic characterization of eigenvalues
- Substitutions and \(\beta\) systems of numeration
- Words derivated from Sturmian words
Cited in
(25)- A characterization of substitutive sequences using return words
- Fixed points of Sturmian morphisms and their derivated words
- Acyclic, connected and tree sets
- On the structure of (- )-integers
- Sturmian jungle (or garden?) On multiliteral alphabets
- Enumeration formulæ in neutral sets
- Palindromes in infinite ternary words
- Presentations of Schützenberger groups of minimal subshifts.
- Interval exchanges, admissibility and branching Rauzy induction
- On generating binary words palindromically
- The abelian complexity of infinite words and the Frobenius problem
- Eventually dendric shift spaces
- The sequence of return words of the Fibonacci sequence
- Derived sequences of complementary symmetric Rote sequences
- A geometric interpretation of the Schützenberger group of a minimal subshift
- On Substitutions Preserving Their Return Sets
- Dyck Words, Pattern Avoidance, and Automatic Sequences
- RECURRENCE FUNCTION OF THE TERNARY THUE-MORSE WORD
- Critical exponent of binary words with few distinct palindromes
- Stability properties for subgroups generated by return words
- Algebraic characterization of dendricity
- The asymptotic repetition threshold of sequences rich in palindromes
- Neutral and tree sets of arbitrary characteristic
- Critical exponent of ternary words with few distinct palindromes
- Relation between powers of factors and the recurrence function characterizing Sturmian words
This page was built for publication: Sequences with constant number of return words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1022352)
