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.
更多信息和选项
- 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 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html.
文本
Wolfram Research (2012)，DeBruijnSequence，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html.
CMS
Wolfram 语言. 2012. "DeBruijnSequence." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html.
APA
Wolfram 语言. (2012). DeBruijnSequence. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/DeBruijnSequence.html 年