Mar 13, 2009 · Abstract: We show that there exists an uniformly recurrent infinite word whose set of factors is closed under reversal and which has only ...

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 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 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 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 ...

We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets and give answers to this problem.

Every infinite binary word contains a palindromic factor of length greater than 3. There exist infinite binary words containing no palindromic factor of length ...

May 17, 2020 · If there exists an infinite word over Σ avoiding p, then there exists an infinite recurrent word over Σ avoiding p. This recurrent word also ...

We study the problem of constructing infinite words having a prescribed finite set P of palindromes. We first establish that the language of all words with ...

Palindromic complexity of infinite words coding interval exchange transformations, Words ... Infinite words without palindrome (2006) (Preprint). [12] Berthé, ...