Finite and infinite closed-rich words

DOI10.1016/j.tcs.2023.114315arXiv2111.00863OpenAlexW3209086458MaRDI QIDQ6140350

Olga G. Parshina, Svetlana Puzynina

Publication date: 2 January 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.00863

zbMATH Keywords

return wordrich wordclosed word

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• On a question of Hof, Knill and Simon on palindromic substitutive systems
• 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
• Towards a characterization of self-similar tilings in terms of derived Voronoï tessellations
• On \(k\)-abelian palindromes
• Singular continuous spectrum for palindromic Schrödinger operators
• On closed-rich words
• 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
• Substitutional dynamical systems, Bratteli diagrams and dimension groups
• Uniqueness Theorems for Periodic Functions
• The “Runs” Theorem
• Sequences with minimal block growth
• A characterization of Sturmian words by return words
• Episturmian words and some constructions of de Luca and Rauzy

This page was built for publication: Finite and infinite closed-rich words