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
Fici, G., Zamboni, L. (2013). On the least number of palindromes contained in an infinite word. THEORETICAL COMPUTER SCIENCE, 481, 1-8 [10.1016/j.tcs.2013.02.013].
On the least number of palindromes contained in an infinite word
FICI, Gabriele;
2013-04-15
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 periodic and non-periodic words, closed or not under reversal of factors. We then investigate the same problem when the alphabet has size two
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
On the least number of palindromes contained in an infinite word .pdf
Solo gestori archvio
Descrizione: Il testo pieno dell’articolo è disponibile al seguente link: https://www.sciencedirect.com/science/article/pii/S0304397513001229
Tipologia:
Versione Editoriale
Dimensione
387.71 kB
Formato
Adobe PDF
|
387.71 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
