On universal partial words
type: Item
instance of: scholarly article
title: On universal partial words
zbMATH Open document ID: 1378.05112
author: Herman Z. Q. Chen
author: Sergey Kitaev
author: Torsten Mütze
author: Brian Y. Sun
publication date: 2018-01-18T00:00:00Z
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 6827180
zbMATH Keywords: universal word
zbMATH Keywords: partial word
zbMATH Keywords: de Bruijn graph
zbMATH Keywords: Eulerian cycle
zbMATH Keywords: Hamiltonian cycle
MaRDI profile type: Publication
full work available at URL: j.endm.2017.06.043
OpenAlex ID: W2560612881
cites work: Partial words and a theorem of Fine and Wilf
cites work: On the complexity of deciding avoidability of sets of partial words
cites work: Primitive partial words
cites work: Q3527014
cites work: Unavoidable sets of partial words
cites work: Universal cycles for combinatorial structures
cites work: Pattern avoidance in partial permutations
cites work: Q5834367
cites work: Square-free partial words
cites work: Overlap-freeness in infinite partial words
cites work: Shorthand universal cycles for permutations
cites work: m-ary closed sequences
cites work: The coolest way to generate binary strings
cites work: Binary Ring Sequences
DOI: 10.1016/J.ENDM.2017.06.043
description: scientific article; zbMATH DE number 6827180