On highly palindromic words: the ternary case
From MaRDI portal
Publication:777417
DOI10.1016/J.DAM.2020.04.006zbMath1448.68363OpenAlexW3016799184MaRDI QIDQ777417
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.04.006
Related Items (2)
On highly palindromic words: the \(n\)-ary case ⋮ On a theorem concerning partially overlapping subpalindromes of a binary word
Cites Work
- Unnamed Item
- Languages invariant under more symmetries: overlapping factors versus palindromic richness
- On palindromic factorization of words
- Abelian bordered factors and periodicity
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
- Palindromic rich words and run-length encodings
- Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
- Palindromic richness
- On highly palindromic words
- Palindromic length in free monoids and free groups
- Sturmian numeration systems and decompositions to palindromes
- Rich square-free words
- Palindromic decompositions with gaps and errors
- On the number of rich words
- On highly potential words
- Abelian borders in binary words
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- Diverse Palindromic Factorization is NP-Complete
- Greedy Palindromic Lengths
- Palindromic length in linear time
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: On highly palindromic words: the ternary case
