Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Martin, Kirin"'
A universal partial cycle (or upcycle) for $\mathcal{A}^n$ is a cyclic sequence that covers each word of length $n$ over the alphabet $\mathcal{A}$ exactly once -- like a De Bruijn cycle, except that we also allow a wildcard symbol $\mathord{\diamond
Externí odkaz:
http://arxiv.org/abs/2310.13067
