Sequences with constant number of return words

DOI10.1007/S00605-008-0001-2MaRDI QIDQ1022352zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Sturmian words

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• A characterization of Sturmian words by return words
• Return words in Sturmian and episturmian words
• Abelian returns in Sturmian words
• A characterization of substitutive sequences using return words
• A new geometric approach to Sturmian words

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

(21)

• 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
• A characterization of substitutive sequences using return words
• Sturmian jungle (or garden?) On multiliteral alphabets
• Acyclic, connected and tree sets
• Dyck Words, Pattern Avoidance, and Automatic Sequences
• Neutral and tree sets of arbitrary characteristic
• RECURRENCE FUNCTION OF THE TERNARY THUE-MORSE WORD
• 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)