Infinite words without palindrome
Discrete Mathematics
2009-03-16 v1
Abstract
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 factors.
Cite
@article{arxiv.0903.2382,
title = {Infinite words without palindrome},
author = {Jean Berstel and Luc Boasson and Olivier Carton and Isabelle Fagnot},
journal= {arXiv preprint arXiv:0903.2382},
year = {2009}
}
Comments
3 pages