Smallest and Largest Block Palindrome Factorizations

DOI10.1007/978-3-031-33180-0_14zbMath1529.68237arXiv2302.13147OpenAlexW4381304387MaRDI QIDQ6134873

Daniel Gabric, Jeffrey O. Shallit

Publication date: 25 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2302.13147

zbMATH Keywords

recurrencefactorizationunbordered wordblock palindromeunique border

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites Work

• On palindromic factorization of words
• Searching for gapped palindromes
• Block reversal on finite words
• Counting bordered and primitive words with a fixed weight
• Enumeration of bordered words, le langage de la vache-qui-rit
• A note on bifix-free sequences (Corresp.)
• On the palindromic decomposition of binary words
• Maximal unbordered factors of random strings
• Block palindromes: a new generalization of palindromes
• Rich words in the block reversal of a word

This page was built for publication: Smallest and Largest Block Palindrome Factorizations