|
|||||
|
|
An efficient shift rule for the prefer-max De Bruijn sequence |
|
| 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. |
| Keywords: | De Bruijn sequence Ford sequence Prefer-max sequence Shift rule |
| 本文献已被 ScienceDirect 等数据库收录！ | |