On highly palindromic words

DOI10.1016/j.dam.2008.03.039zbMath1187.68363OpenAlexW2085292138MaRDI QIDQ1028422

Štěpán Holub, Kalle Saari

Publication date: 30 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.039

zbMATH Keywords

palindromeword extension(Scattered) subwordabelian unbordered word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (9)

Unavoidable regularities in long words with bounded number of symbol occurrences ⋮ Absent Subsequences in Words ⋮ Abelian combinatorics on words: a survey ⋮ On highly palindromic words: the \(n\)-ary case ⋮ Block reversal on finite words ⋮ Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words ⋮ On a theorem concerning partially overlapping subpalindromes of a binary word ⋮ On highly palindromic words: the ternary case ⋮ ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)

Cites Work

• Subword conditions and subword histories
• Reconstruction of sequences
• On a reconstruction problem for sequences
• Reconstruction from subsequences.
• Connections between subwords and certain matrix mappings
• Words and special factors
• Unnamed Item
• Unnamed Item

This page was built for publication: On highly palindromic words