We extend the left-to-right Lyndon factorisation of a word to the left Lyndon tree construction of a Lyndon word. It yields an algorithm to sort the prefixes of a Lyndon word according to the infinite ordering defined by Dolce et al. (2019). A straightforward variant computes the left Lyndon forest of a word. All algorithms run in linear time on a general alphabet, that is, in the letter-comparison model.

中文翻译：

---

左林登树构造

我们将单词的从左到右Lyndon分解扩展到Lyndon单词的左Lyndon树构造。它产生了一种算法，该算法根据Dolce等人定义的无限顺序对Lyndon词的前缀进行排序。（2019）。一个简单的变体计算单词的左Lyndon林。所有算法都在一般字母（即字母比较模型）中线性运行。