A cyclic sequence over an alphabet of size in which every word of length appears exactly once as a cyclic window. Its length is . The De Bruijn graph converts its construction into an Eulerian cycle problem.

Ancestors (4)

  1. Combinatorics
  2. Area of mathematics
  3. Mathematics
  4. Home

Incoming links (2)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

De Bruijn sequence by Wikipedia Bot 1
View more
A De Bruijn sequence is a cyclic sequence containing a particular set of symbols in such a way that every possible subsequence of a given length appears exactly once. Specifically, for a sequence of length \( n \) over an alphabet of size \( k \), a De Bruijn sequence is a cyclic sequence of length \( k^n \) in which every possible string of length \( n \) made up of the symbols from the alphabet occurs as a contiguous subsequence.
Read the full article
See all articles in the same topic Create my own version