On longest palindromic subwords of finite binary words

DOI10.1016/J.DISC.2021.112493MaRDI QIDQ2037574zbMATH OpenOpenAlexFDO

Authors Jan Petr, Jan Soukup

Publication date 8 July 2021

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2021.112493

zbMATH Keywords

palindromesbinary wordscircular wordspalindromic subwords

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Palindromic subsequences in finite words
• Palindromes in circular words
• Greedy palindromic lengths
• On highly palindromic words
• Palindromic length of words with many periodic palindromes

Cites work

• Palindromic subsequences in finite words

Cited in

(4)

• Palindromes in circular words
• Palindromic subsequences in finite words
• On a theorem concerning partially overlapping subpalindromes of a binary word
• On binary palindromes of the form \(10^n\pm 1\)

This page was built for publication: On longest palindromic subwords of finite binary words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2037574)