Jakub Radoszewski

Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence

2015 · arXiv (Cornell University)

We give efficient algorithms for ranking Lyndon words of length $n$ over an alphabet of size $σ$. The rank of a Lyndon word is its position in the sequence of lexicographically ordered Lyndon words of …