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

Arbitrary order de Bruijn sequences become too long for this Demonstration rather quickly. Their lengths grows according to the function: LengthOfAlphabet^Order.

De Bruijn Sequence (Wolfram MathWorld)

"De Bruijn Sequences" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/DeBruijnSequences/

Contributed by: Michael Schreiber

Free Download: Mathematica Player--Runs all Demonstrations & more

College Mathematics
Combinatorics
Discrete Mathematics

Browse all topics

De Bruijn Graph Arcs
Binary de Bruijn 2D Hex Maps
Permutations
Gray Indexed Minimum Change Permutation
Elementary Cellular Automaton Rules by Gray Code
De Bruijn Sequences Provide Compact Initial Conditions
Successes and Failures in a Run of Bernoulli Trials
Counting Paths through a Grid
Perfect Riffle Shuffling
Conjecture de Beraha pour les roues (French)

Email
Link to URL
Embed
Bookmark

Make a new version of this Demonstration
Upload a new Demonstration

Source page:

Name (optional)

Occupation (optional)

Organization (optional)

I use Mathematica:

often

occasionally

never

Country (optional)
Remember me

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »