DeBruijnSequence
Combinatorica`
Combinatorica`
DeBruijnSequence
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
DeBruijnSequence[a,n]
returns a De Bruijn sequence on the alphabet a, a shortest sequence in which every string of length n on alphabet a occurs as a contiguous subsequence.
Details and Options
- DeBruijnSequence functionality is now available in the built-in Wolfram Language function DeBruijnSequence.
- To use DeBruijnSequence, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012), DeBruijnSequence, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html.
Text
Wolfram Research (2012), DeBruijnSequence, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html.
CMS
Wolfram Language. 2012. "DeBruijnSequence." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html.
APA
Wolfram Language. (2012). DeBruijnSequence. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html