In the here presented article, its author sets up an algorithm for doing suffix standardization of a given Lyndon word in time, using a binary, planary complete tree. After this he shows how the latter can be used to factorize any word into a decreasing product of Lyndon words.

While working with Lyndon words and reading some articles, I noticed some interesting properties about Lyndon words I also described in this work.