On highly palindromic words: the ternary case
From MaRDI portal
Publication:777417
DOI10.1016/J.DAM.2020.04.006zbMATH Open1448.68363OpenAlexW3016799184MaRDI QIDQ777417FDOQ777417
Authors: Kristina Ago, Bojan Bašić 
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
Recommendations
Cites Work
- Palindromic richness
- Episturmian words and some constructions of de Luca and Rauzy
- Rich square-free words
- On highly palindromic words
- Languages invariant under more symmetries: overlapping factors versus palindromic richness
- On palindromic factorization of words
- Palindromic rich words and run-length encodings
- Diverse Palindromic Factorization is NP-Complete
- Abelian borders in binary words
- Abelian bordered factors and periodicity
- On the number of abelian bordered words (with an example of automatic theorem-proving)
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences
- 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
- Palindromic length in free monoids and free groups
- Sturmian numeration systems and decompositions to palindromes
- Palindromic decompositions with gaps and errors
- On the number of rich words
- On highly potential words
- Greedy palindromic lengths
- Dyck words, lattice paths, and abelian borders
- Palindromic length in linear time
Cited In (5)
This page was built for publication: On highly palindromic words: the ternary case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777417)
