An Efficient Shift Rule for the Prefer-Max De Bruijn Sequence

Yair Ashlagi
Yair Ashlagi
Amir Rubin
Amir Rubin
Yotam Svoray
Yotam Svoray

Discrete Mathematics, Volume abs/1706.01106, Issue 1, 2019.

Cited by: 1|Bibtex|Views2
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

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.

Code:

Data:

Your rating :
0

 

Tags
Comments