On universal partial words
From MaRDI portal
Publication:1689916
DOI10.1016/j.endm.2017.06.043zbMath1378.05112OpenAlexW2560612881MaRDI QIDQ1689916
Brian Y. Sun, Sergey Kitaev, Torsten Mütze, Herman Z. Q. Chen
Publication date: 18 January 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.043
Related Items (3)
Scattered Factor-Universality of Words ⋮ Computing generalized de Bruijn sequences ⋮ Absent Subsequences in Words
Cites Work
- Unnamed Item
- Unnamed Item
- The coolest way to generate binary strings
- On the complexity of deciding avoidability of sets of partial words
- Pattern avoidance in partial permutations
- Unavoidable sets of partial words
- Square-free partial words
- Overlap-freeness in infinite partial words
- Universal cycles for combinatorial structures
- Partial words and a theorem of Fine and Wilf
- Shorthand universal cycles for permutations
- Primitive partial words
- m-ary closed sequences
- Binary Ring Sequences
This page was built for publication: On universal partial words