De Bruijn sequence
id:
de-bruijn-sequence-198-12229998
title:
De Bruijn sequence
text:
In combinatorial mathematics, a de Bruijn sequence of order n on a size-k alphabet A is a cyclic sequence in which every possible length-n string on A occurs exactly once as a substring. Such a sequence is denoted by B(k, n) and has length kn, which is also the number of distinct strings of length n on A. Each of these distinct strings, when taken as a substring of B(k, n), must start at a different position, because substrings starting at the same position are not distinct. Therefore, B(k, n) m
brand slug:
wiki
category slug:
encyclopedia
description:
Cycle through all length-k sequences
original url:
https://en.wikipedia.org/wiki/De_Bruijn_sequence
date created:
date modified:
2024-03-25T03:20:55Z
main entity:
{"identifier":"Q1953457","url":"https://www.wikidata.org/entity/Q1953457"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/b/ba/De_Bruijn_sequence.svg","width":744,"height":883}
fields total:
13
integrity:
15