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

Amir Rubin; Gal Amram; Gera Weiss; Moshe Schwartz; Yair Ashlagi; Yotam Svoray

arxiv: 1706.01106 · v2 · pith:NGNWMJUMnew · submitted 2017-06-04 · 💻 cs.DM

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

Gal Amram , Yair Ashlagi , Amir Rubin , Yotam Svoray , Moshe Schwartz , Gera Weiss This is my paper

classification 💻 cs.DM

keywords sequenceruleshiftbruijnefficientprefer-maxalgorithmalphabet

0 comments

read the original 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.

This paper has not been read by Pith yet.

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

discussion (0)