Finding the Leftmost Critical Factorization on Unordered Alphabet
arXiv:1509.01018
Abstract
We present a linear time and space algorithm computing the leftmost critical factorization of a given string on an unordered alphabet.
arXiv comment13 pages, 13 figures (accepted to Theor. Comp. Sci.)