On Arch Factorization and Subword Universality for Words and Compressed Words

From MaRDI portal
Publication:6134881




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.









This page was built for publication: On Arch Factorization and Subword Universality for Words and Compressed Words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134881)