On universal partial words
From MaRDI portal
Recommendations
Cites work
- Binary Ring Sequences
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- m-ary closed sequences
- On the complexity of deciding avoidability of sets of partial words
- Open problems on partial words
- Overlap-freeness in infinite partial words
- Partial words and a theorem of Fine and Wilf
- Pattern avoidance in partial permutations
- Primitive partial words
- Shorthand universal cycles for permutations
- Square-free partial words
- The coolest way to generate binary strings
- Unavoidable sets of partial words
- Universal cycles for combinatorial structures
Cited in
(15)- The reverse spelling of an FPrt-universal word in two letters
- Computing generalized de Bruijn sequences
- Universal partial words over non-binary alphabets
- Universal arrays
- On quasi-universal word functions
- On universal partial words for word-patterns and set partitions
- On universal partial words
- Scattered Factor-Universality of Words
- Absent Subsequences in Words
- Matching patterns with variables under Simon's congruence
- Periods of strongly connected multivariate digraphs
- k-universality of regular languages
- The edit distance to k-subsequence universality
- \(k\)-universality of regular languages
- The edit distance to \(k\)-subsequence universality
This page was built for publication: On universal partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689916)