EUVIMEDEUVIMED entdecken
Crossref

On universal partial words

Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze, Brian Y. Sun

Discrete Mathematics & Theoretical Computer Science · 2017

DOI: 10.23638/dmtcs-19-1-16 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, 2017. Verfasst von Herman Z. Q. Chen und 3 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 systematic study of universal partial words. These are words that in addition to the letters from $A$ may contain an arbitrary number of occurrences of a special `joker' symbol $\Diamond\notin A$, which can be substituted by any symbol from $A$. For example, $u=0\Diamond 011100$ is a linear partial word for the binary alphabet $A=\{0,1\}$ and for $n=3$ (e.g., the first three letters of $u$ yield the subwords $000$ and $010$). We present results on the existence and non-existence of linear and cyclic universal partial words in different situations (depending on the number of $\Diamond$s and their positions), including various explicit constructions. We also provide numerous examples of universal partial words that we found with the help of a computer.

Zitieren

APA

Chen, H. Z. Q., Kitaev, S., Mütze, T., & Sun, B. Y. (2017). On universal partial words. Discrete Mathematics & Theoretical Computer Science. https://doi.org/10.23638/dmtcs-19-1-16

Vancouver

Chen HZQ, Kitaev S, Mütze T, Sun BY. On universal partial words. Discrete Mathematics & Theoretical Computer Science. 2017. doi:10.23638/dmtcs-19-1-16

BibTeX
@article{Chen2017,
  author = {Chen, Herman Z. Q. and Kitaev, Sergey and Mütze, Torsten and Sun, Brian Y.},
  title = {On universal partial words},
  journal = {Discrete Mathematics & Theoretical Computer Science},
  year = {2017},
  doi = {10.23638/dmtcs-19-1-16}
}
Kostenlos starten →