Finding the Leftmost Critical Factorization on Unordered Alphabet
Data Structures and Algorithms
2016-04-12 v2
Abstract
We present a linear time and space algorithm computing the leftmost critical factorization of a given string on an unordered alphabet.
Cite
@article{arxiv.1509.01018,
title = {Finding the Leftmost Critical Factorization on Unordered Alphabet},
author = {Dmitry Kosolobov},
journal= {arXiv preprint arXiv:1509.01018},
year = {2016}
}
Comments
13 pages, 13 figures (accepted to Theor. Comp. Sci.)