Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874760 | Journal of Discrete Algorithms | 2017 | 11 Pages |
Abstract
We present the first efficient algorithm to list necklaces, Lyndon words, or pseudo-necklaces of length n in colexicographic order. The algorithm has two interesting properties. First, it can be applied to construct a de Bruijn sequence of order n in O(1)-time per bit. Second, it can easily be modified to efficiently list necklaces, Lyndon words, or pseudo-necklaces of length n in binary reflected Gray code order.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Joe Sawada, Aaron Williams, Dennis Wong,