Skip to main content

All Questions

1 question with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
3 votes
0 answers
187 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 ...
user avatar