Finding the leftmost critical factorization on unordered alphabet

Dmitry Kosolobov. Finding the leftmost critical factorization on unordered alphabet. Theoretical Computer Science, 636:56-65, 2016. [doi]

Authors

Dmitry Kosolobov

This author has not been identified. Look up 'Dmitry Kosolobov' in Google