Abstract. We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets and give answers to this problem for ...
Pirillo observed that any finite word w of length |w| contains at most |w| + 1 distinct palindromes (including the empty word). Such words are 'rich' in ...
Jan 15, 2013 · We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem.
Abstract. We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem ...
People also ask
How to calculate the number of palindromes?
What is an example of a palindrome number?
What is the maximum number of 6 letter palindromes?
What are the properties of a palindrome number?
We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only finitely many palindromic ...
We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets and give answers to this problem for ...
It was shown in [3], that any finite 1D binary word of length greater than 8, has at least 8 palindromic factors. A set of 1D words that achieve the bound of ...
We present a method which displays all palindromes of a given length from De Bruijn words of a certain order, and also a recursive one which constructs all ...
Authors · G Fici, L Q Zamboni ; Publication year · 2013 ; Journal · Theoretical Computer Science ; Volume · 481 ; First page · 1.
Fici, G., Zamboni, L. (2013). On the least number of palindromes contained in an infinite word. THEORETICAL COMPUTER SCIENCE, 481, ...