3
votes
0answers
152 views

Generalised de Bruijn Graph

I have encountered sets of the following type, consisting of words over a finite aphabet $A$. If $S$ is such a set, then $S$ is finite, No word in $S$ is part of another element of $S$, and every ...