论文标题
左林登树建筑
Left Lyndon tree construction
论文作者
论文摘要
我们将单词的从左到右延伸到Lyndon Word的左Lyndon树的构造。它产生了一种算法，可以根据Dolce等人定义的无限顺序对Lyndon单词的前缀进行排序。 （2019）。直接的变体计算单词的左林登森林。所有算法以线性时间在一般字母内，即在字母复杂模型中运行。
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.
