On Arch Factorization and Subword Universality for Words and Compressed Words
Résumé
Using arch-jumping functions and properties of the arch factorization of words, we propose a new algorithm for computing the subword circular universality index of words. We also introduce the subword universality signature for words, that leads to simple algorithms for the universality indexes of SLP-compressed words.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|