Computer Science – Discrete Mathematics
Scientific paper
2009-03-13
Computer Science
Discrete Mathematics
3 pages
Scientific paper
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.
Berstel Jean
Boasson Luc
Carton Olivier
Fagnot Isabelle
No associations
LandOfFree
Infinite words without palindrome does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Infinite words without palindrome, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Infinite words without palindrome will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-228785