On closed-rich words

DOI10.1007/978-3-030-79416-3_23MaRDI QIDQ2117106zbMATH OpenOpenAlexFDO

Authors Svetlana Puzynina, Olga G. Parshina

Publication date 21 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79416-3_23

zbMATH Keywords

return wordrich wordclosed word

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• A characterization of Sturmian words by return words
• A characterization of substitutive sequences using return words
• A classification of trapezoidal words
• Closed factorization
• Efficient identification of \(k\)-closed strings
• Episturmian words and some constructions of de Luca and Rauzy
• How many double squares can a string contain?
• How many squares can a string contain?
• Introducing privileged words: privileged complexity of Sturmian words
• ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
• On k-abelian palindromes
• On the least number of palindromes contained in an infinite word
• On the number of closed factors in a word
• Open and closed factors in Arnoux-Rauzy words
• Open and closed words
• Palindromic richness
• Symbolic Dynamics
• The ``runs conjecture
• The ``runs theorem

Cited in

(3)

• Finite and infinite closed-rich words
• Open and Closed Prefixes of Sturmian Words
• ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS

This page was built for publication: On closed-rich words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117106)