An Efficient Shift Rule for the Prefer-Max De Bruijn Sequence.
Discrete Mathematics(2019)
摘要
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.
更多查看译文
关键词
De Bruijn sequence,Ford sequence,Prefer-max sequence,Shift rule
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络