AI 中文总结
研究权重受限的删减德布鲁因序列，考虑从任意有限字母表取符号的n元组的三种权重函数，建立了与Ruskey等人类似的结果，扩展了2012年的相关成果。
AI 中文摘要
2012年，Ruskey、Sawada和Williams表明，可以构造一个二进制删减德布鲁因序列，其中包含每个可能的r的汉明权重为r或r + 1的所有n元组，且无其他情况。本文研究该结果的扩展，需要选择一个适用于从任意（有限）大小字母表中选取符号的n元组的类似权重函数。我们考虑了三种这样的权重函数，并在每种情况下都建立了与Ruskey等人类似的结果。
英文摘要
In 2011/12, Ruskey, Sawada, Stevens and Williams showed that a binary cut-down de Bruijn sequence can be constructed containing all $n$-tuples of Hamming weight either $r$ or $r+1$ for every possible $r$, and no others. In this paper we examine extensions of this result that require choosing a weight-like function applying to $n$-tuples with symbols taken from an alphabet of arbitrary (finite) size. We consider three possible such weight functions, and in each case establish an analogous result to that of Ruskey et al.
CommentsReferences to relevant prior art have been added
