Core idea: Same as De Bruijn sequence, but with alphabet .
Graph construction:
- vertices (each is an -digit string)
- edges (each is an -digit string)
- Vertex has outgoing edges (append )
- Each vertex has in-degree out-degree
Euler circuit exists: All vertices have equal in/out degrees.
The result string has length .