On arch factorization and subword universality for words and compressed words
Formal Languages and Automata Theory
2023-04-25 v1
Abstract
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.
Cite
@article{arxiv.2304.11932,
title = {On arch factorization and subword universality for words and compressed words},
author = {Philippe Schnoebelen and Julien Veron},
journal= {arXiv preprint arXiv:2304.11932},
year = {2023}
}
Comments
Accepted for publication in Proc. 14th Int. Conf. Combinatorics on Words (WORDS 2023)