Universal partial words over non-binary alphabets

作者：Goeckner Bennet; Groothuis Corbin^*; Hettle Cyrus; Kell Brian; Kirkpatrick Pamela; Kirsch Rachel; Solava Ryan

来源：Theoretical Computer Science, 2018, 713: 56-65.

DOI：10.1016/j.tcs.2017.12.022

• Combinatorics on words
• Universal cycles

Chen, Kitaev, Maze, and Sun recently introduced the notion of universal partial words, a generalization of universal words and de Bruijn sequences. Universal partial words allow for a wild-card character lozenge, which is a placeholder for any letter in the alphabet. We extend results from the original paper and develop additional proof techniques to study these objects. For non-binary alphabets, we show that universal partial words have periodic lozenge structure and are cyclic, and we give number-theoretic conditions on the existence of universal partial words. In addition, we provide an explicit construction for an infinite family of universal partial words over non-binary alphabets.

• 出版日期2018-2-22