On the least number of palindromes contained in an infinite word - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2013

On the least number of palindromes contained in an infinite word

Résumé

We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then investigate the same problem when the alphabet has size two.

Dates et versions

hal-00865188 , version 1 (24-09-2013)

Identifiants

Citer

Gabriele Fici, Luca Q. Zamboni. On the least number of palindromes contained in an infinite word. Theoretical Computer Science, 2013, 481, pp.1-8. ⟨10.1016/j.tcs.2013.02.013⟩. ⟨hal-00865188⟩
197 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More