Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6875625 | Theoretical Computer Science | 2018 | 10 Pages |
Abstract
Chen, Kitaev, Mütze, 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 â, 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 â 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Bennet Goeckner, Corbin Groothuis, Cyrus Hettle, Brian Kell, Pamela Kirkpatrick, Rachel Kirsch, Ryan Solava,