Fast enumeration of run-length-limited words
Yulia A. Medvedeva, Boris Ya. Ryabko · 2009
An algorithm for enumeration and de-numeration of run-length-limited words (dklr-sequences) is proposed. The complexity of the algorithm does not exceed O(log3n log log n), where n is the length of word, whereas known methods have the complexity that is not less than c n, c > 0.