On universal partial words

A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is a word over $A$ such that every word in $A^n$ appears exactly once as a subword (cyclically or linearly). It is well-known and easy to prove that universal words exist for any $A$ and $n$. In this work we initiate the systemati...

Full description

Bibliographic Details
Main Authors: Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Y. Sun
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2017-05-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/2205/pdf