8769
TOPICS
LATEST
ABOUT
AUTHORING AREA
PARTICIPATE
Your browser does not support JavaScript or it may be disabled!
De Bruijn Sequences
The cyclic de Bruijn sequences shown inside include all the substrings of a given length as shown outside.
Contributed by:
Michael Schreiber
SNAPSHOTS
DETAILS
Arbitrary order de Bruijn sequences become too long for this Demonstration rather quickly. Their lengths grows according to the function:
LengthOfAlphabet^Order
.
RELATED LINKS
De Bruijn Sequence
(
Wolfram
MathWorld
)
PERMANENT CITATION
"
De Bruijn Sequences
" from
the Wolfram Demonstrations Project
http://demonstrations.wolfram.com/DeBruijnSequences/
Contributed by:
Michael Schreiber
Share:
Embed Interactive Demonstration
New!
Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site.
More details »
Download Demonstration as CDF »
Download Author Code »
(preview »)
Files require
Wolfram
CDF Player
or
Mathematica
.
Related Demonstrations
More by Author
De Bruijn Graph Arcs
Michael Schreiber
Binary de Bruijn 2D Hex Maps
Michael Schreiber
Permutations
Michael Trott
Gray Indexed Minimum Change Permutation
Michael Schreiber
Elementary Cellular Automaton Rules by Gray Code
Michael Schreiber
Perfect Riffle Shuffling
Kovas Boguta
Successes and Failures in a Run of Bernoulli Trials
Chris Boucher
Counting Paths through a Grid
George Beck and Rob Morris
De Bruijn Sequences Provide Compact Initial Conditions
John Kiehl
Pascal's Triangle Row Digits
Michael Schreiber
Related Topics
College Mathematics
Combinatorics
Discrete Mathematics
Browse all topics
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to
Mathematica Player 7EX
I already have
Mathematica Player
or
Mathematica 7+