Universal partial words over non-binary alphabets

DOI10.1016/j.tcs.2017.12.022zbMath1394.68271arXiv1611.03928OpenAlexW2566543723WikidataQ115036507 ScholiaQ115036507MaRDI QIDQ1694683

Cyrus Hettle, Brian Kell, Bennet Goeckner, Pamela Kirkpatrick, Corbin Groothuis, Ryan Solava, Rachel Kirsch

Publication date: 6 February 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.03928

zbMATH Keywords

combinatorics on wordsuniversal cyclespartial word

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (5)

Scattered Factor-Universality of Words ⋮ Graph universal cycles: compression and connections to universal cycles ⋮ Absent Subsequences in Words ⋮ On shortening \(u\)-cycles and \(u\)-words for permutations ⋮ Shortened universal cycles for permutations

Cites Work

• Counting bordered partial words by critical positions
• Unavoidable sets of partial words
• Universal cycles for combinatorial structures
• Border correlations, lattices, and the subgraph component polynomial
• On universal partial words

This page was built for publication: Universal partial words over non-binary alphabets