Upper bound for palindromic and factor complexity of rich words
From MaRDI portal
Publication:5021104
DOI10.1051/ita/2020008OpenAlexW2894597967MaRDI QIDQ5021104
Publication date: 12 January 2022
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.03573
Related Items (3)
Palindromic factorization of rich words ⋮ Prefix palindromic length of the Sierpinski word ⋮ A unique extension of rich words
Cites Work
- Extensions of rich words
- Palindromic complexity of codings of rotations
- Palindromic rich words and run-length encodings
- Palindromic richness
- On words with the zero palindromic defect
- Palindrome complexity.
- A new characteristic property of rich words
- Subword complexity and power avoidance
- Factor versus palindromic complexity of uniformly recurrent infinite words
- A connection between palindromic and factor complexity using return words
- On the number of rich words
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- Sturmian jungle (or garden?) on multiliteral alphabets
- The Number of Distinct Subpalindromes in Random Words
- Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
- Pal k is Linear Recognizable Online
- Transition property for cube-free words
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: Upper bound for palindromic and factor complexity of rich words
