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.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"k": "<k>",
"n": "<n>"
},
"name": "de_bruijn"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| k | Yes | Alphabet size (2-10) | |
| n | Yes | Substring length (1-10) |