Dmitry Kosolobov. Finding the leftmost critical factorization on unordered alphabet. Theoretical Computer Science, 636:56-65, 2016. [doi]
@article{Kosolobov16-0,
title = {Finding the leftmost critical factorization on unordered alphabet},
author = {Dmitry Kosolobov},
year = {2016},
doi = {10.1016/j.tcs.2016.04.037},
url = {http://dx.doi.org/10.1016/j.tcs.2016.04.037},
researchr = {https://researchr.org/publication/Kosolobov16-0},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {636},
pages = {56-65},
}