On highly palindromic words: the \(n\)-ary case
From MaRDI portal
Publication:2231750
DOI10.1016/j.dam.2021.07.020zbMath1482.68189OpenAlexW4200234882MaRDI QIDQ2231750
Publication date: 30 September 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.07.020
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On palindromic factorization of words
- Algorithms for computing abelian periods of words
- Abelian bordered factors and periodicity
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
- Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
- On highly palindromic words: the ternary case
- Palindromic richness
- On highly palindromic words
- Strongly non-repetitive sequences and progression-free sets
- Palindromic length in free monoids and free groups
- Sturmian numeration systems and decompositions to palindromes
- A note on efficient computation of all abelian periods in a string
- Abelian borders in binary words
- Fast Algorithms for Abelian Periods in Words and Greatest Common Divisor Queries
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- IDENTIFYING ALL ABELIAN PERIODS OF A STRING IN QUADRATIC TIME AND RELEVANT PROBLEMS
- Palindromic length in linear time
- Abelian squares are avoidable on 4 letters
- ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)
- Abelian periods, partial words, and an extension of a theorem of Fine and Wilf
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: On highly palindromic words: the \(n\)-ary case
