de_bruijn
Generates a B(k,n) sequence containing every k-ary substring of length n exactly once by taking alphabet size k and substring length n.
Instructions
Generate a de Bruijn sequence B(k,n) containing every k-ary substring of length n exactly once.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| k | Yes | Alphabet size (2-10) | |
| n | Yes | Substring length (1-10) |