2000 character limit reached
Left Lyndon tree construction (2011.12742v1)
Published 25 Nov 2020 in cs.DS and cs.FL
Abstract: 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.