On greedy algorithms for binary de Bruijn sequences

We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequenc...

Full description

Saved in:
Bibliographic Details
Published inApplicable algebra in engineering, communication and computing Vol. 33; no. 5; pp. 523 - 550
Main Authors Chang, Zuling, Ezerman, Martianus Frederic, Fahreza, Adamas Aqsa
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2022
Springer Nature B.V
Subjects
Artificial Intelligence
Computer Hardware
Computer Science
Greedy algorithms
Original Paper
Symbolic and Algebraic Manipulation
Theory of Computation
11B50
de Bruijn sequence
Binary periodic sequence
Greedy algorithm
Feedback function
State graph
94A60
94A55
Online AccessGet full text
ISSN0938-1279
1432-0622
DOI10.1007/s00200-020-00459-3

Cover

More Information
Summary:We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our algorithm.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0938-1279
1432-0622
DOI:10.1007/s00200-020-00459-3