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

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.

BibTeX

@misc{reference.wolfram_2021_debruijnsequence, author="Wolfram Research", title="{DeBruijnSequence}", year="2012", howpublished="\url{https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html}", note=[Accessed: 16-September-2021 ]}

BibLaTeX

@online{reference.wolfram_2021_debruijnsequence, organization={Wolfram Research}, title={DeBruijnSequence}, year={2012}, url={https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html}, note=[Accessed: 16-September-2021 ]}

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