On closed-rich words
From MaRDI portal
Publication:2117106
DOI10.1007/978-3-030-79416-3_23OpenAlexW3174916666MaRDI QIDQ2117106FDOQ2117106
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
Cites Work
- Title not available (Why is that?)
- Palindromic richness
- A characterization of substitutive sequences using return words
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Episturmian words and some constructions of de Luca and Rauzy
- How many squares can a string contain?
- A classification of trapezoidal words
- Closed factorization
- How many double squares can a string contain?
- The ``runs theorem
- On the least number of palindromes contained in an infinite word
- Introducing privileged words: privileged complexity of Sturmian words
- The ``runs conjecture
- A characterization of Sturmian words by return words
- Symbolic Dynamics
- On the number of closed factors in a word
- On \(k\)-abelian palindromes
- Open and closed factors in Arnoux-Rauzy words
- Open and closed words
- Efficient identification of \(k\)-closed strings
Cited In (3)
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)
