On a theorem concerning partially overlapping subpalindromes of a binary word

DOI10.1016/J.AAM.2021.102302zbMath1487.68185OpenAlexW3215735579WikidataQ113881578 ScholiaQ113881578MaRDI QIDQ2070082

Bojan Bašić, Kristina Ago

Publication date: 21 January 2022

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2021.102302

zbMATH Keywords

palindromesubwordscattered subwordMP-ratio

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• Unnamed Item
• 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
• On highly palindromic words
• Abelian borders in binary words
• ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)

This page was built for publication: On a theorem concerning partially overlapping subpalindromes of a binary word