Left Lyndon tree construction
Data Structures and Algorithms
2020-11-26 v1 Formal Languages and Automata Theory
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.
Keywords
Cite
@article{arxiv.2011.12742,
title = {Left Lyndon tree construction},
author = {Golnaz Badkobeh and Maxime Crochemore},
journal= {arXiv preprint arXiv:2011.12742},
year = {2020}
}
Comments
18 pages