Left Lyndon tree construction

11/25/2020
by   Golnaz Badkobeh, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset