Sequences with constant number of return words
From MaRDI portal
Publication:1022352
DOI10.1007/S00605-008-0001-2zbMATH Open1185.68503OpenAlexW2113810617MaRDI QIDQ1022352FDOQ1022352
Authors: L'ubomira Balková, Edita Pelantová, Wolfgang Steiner 
Publication date: 22 June 2009
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-008-0001-2
Recommendations
Cites Work
- A characterization of substitutive sequences using return words
- Return words in Sturmian and episturmian words
- Substitution dynamical systems - spectral analysis
- Complexity and special factors
- Structure of three-interval exchange transformations. II: A combinatorial description of the trajectories
- A characterization of Sturmian words by return words
- Substitutions and \(\beta\) systems of numeration
- RECENT RESULTS ON EXTENSIONS OF STURMIAN WORDS
- 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
- Words derivated from Sturmian words
- Substitution dynamical systems : algebraic characterization of eigenvalues
- Complexity of infinite words associated with beta-expansions
Cited In (20)
- On Substitutions Preserving Their Return Sets
- Presentations of Schützenberger groups of minimal subshifts.
- A geometric interpretation of the Schützenberger group of a minimal subshift
- Relation between powers of factors and the recurrence function characterizing Sturmian words
- Critical exponent of binary words with few distinct palindromes
- Sturmian jungle (or garden?) On multiliteral alphabets
- Dyck Words, Pattern Avoidance, and Automatic Sequences
- Acyclic, connected and tree sets
- RECURRENCE FUNCTION OF THE TERNARY THUE-MORSE WORD
- Neutral and tree sets of arbitrary characteristic
- Derived sequences of complementary symmetric Rote sequences
- Fixed points of Sturmian morphisms and their derivated words
- On generating binary words palindromically
- Eventually dendric shift spaces
- Enumeration formulæ in neutral sets
- The abelian complexity of infinite words and the Frobenius problem
- Palindromes in infinite ternary words
- The sequence of return words of the Fibonacci sequence
- Interval exchanges, admissibility and branching Rauzy induction
- On the structure of \((-\beta )\)-integers
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)
