Answers are grounded in this paper and cite their sources.
This paper presents a combinatorial method to construct a de Bruijn sequence for any order n. The method is similar to that of the well-known prefer-one algorithm. The resulting sequences are compared and both methods are shown to be special cases of a unifying graph construction that is capable of generating all de Bruijn sequences.
No takes yet. Share an insight, caveat, or question.
Abbas Alhakim (2010) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: