On highly palindromic words
From MaRDI portal
Publication:1028422
DOI10.1016/j.dam.2008.03.039zbMath1187.68363MaRDI QIDQ1028422
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
68R15: Combinatorics on words
Related Items
ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING), Absent Subsequences in Words, Abelian combinatorics on words: a survey, Unavoidable regularities in long words with bounded number of symbol occurrences, Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words, On highly palindromic words: the ternary case, On a theorem concerning partially overlapping subpalindromes of a binary word, On highly palindromic words: the \(n\)-ary case, Block reversal on finite words
Cites Work