On closed-rich words
From MaRDI portal
Publication:2117106
DOI10.1007/978-3-030-79416-3_23OpenAlexW3174916666MaRDI QIDQ2117106
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Closed factorization
- On the least number of palindromes contained in an infinite word
- Introducing privileged words: privileged complexity of Sturmian words
- How many double squares can a string contain?
- The ``runs conjecture
- Palindromic richness
- How many squares can a string contain?
- A characterization of substitutive sequences using return words
- On \(k\)-abelian palindromes
- Open and closed factors in Arnoux-Rauzy words
- A Classification of Trapezoidal Words
- On the Number of Closed Factors in a Word
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- The “Runs” Theorem
- Symbolic Dynamics
- Efficient Identification of k-Closed Strings
- A characterization of Sturmian words by return words
- Episturmian words and some constructions of de Luca and Rauzy
