An Efficient Shift Rule for the Prefer-Max De Bruijn Sequence
Discrete Mathematics, Volume abs/1706.01106, Issue 1, 2019.
Abstract A shift rule for the prefer-max De Bruijn sequence is formulated, for all sequence orders, and over any finite alphabet. An efficient algorithm for this shift rule is presented, which has linear (in the sequence order) time and memory complexity.
Full Text (Upload PDF)
PPT (Upload PPT)