2 papers
cs.FL2023
On the piecewise complexity of words and periodic words
M. Praveen, Philippe Schnoebelen, Isa Vialard +1
The piecewise complexity of a word is the minimal length of subwords needed to exactly characterise . Its piecewise minimality index is the smallest length suc…
cs.FL2023
On arch factorization and subword universality for words and compressed words
Philippe Schnoebelen, Julien Veron
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 i…