Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.


On universal partial words

Chen, Herman Z.Q. and Kitaev, Sergey and Mutze, Torsten and Sun, Brian Y. (2017) On universal partial words. Electronic Notes in Discrete Mathematics. ISSN 1571-0653 (In Press)

[img] Text (Chen-etal-ENDM-2017-On-universal-partial-words)
Chen_etal_ENDM_2017_On_universal_partial_words.pdf - Accepted Author Manuscript
Restricted to Repository staff only until 3 May 2018.
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo

Download (347kB) | Request a copy from the Strathclyde author


A universal word for a finite alphabet A and some integer n≥1 is a word over A such that every word of length n appears exactly once as a (consecutive) subword. 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 ◊  A, which can be substituted by any symbol from A. For example, u = 0◊011100 is a universal 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 several result on the existence and non-existence of universal partial words in different situations (depending on the number of ◊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.