Recommendations
Cites work
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Algorithmic Combinatorics on Partial Words
- DNA Computing
- Efficient string matching
- Every binary pattern of length six is avoidable on the two-letter alphabet
- Inventories of unavoidable languages and the word-extension conjecture
- On extendibility of unavoidable sets
- On regularity of context-free languages
- On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns
- Partial words and a theorem of Fine and Wilf
- Testing avoidability on sets of partial words is hard
- Two Element Unavoidable Sets of Partial Words
- Unavoidable binary patterns
- Unavoidable languages, cuts and innocent sets of words
Cited in
(15)- Biologically unavoidable sequences
- On universal partial words
- Universal partial words over non-binary alphabets
- On Unavoidable Sets of Word Patterns
- Minimum number of holes in unavoidable sets of partial words of size three
- Classifying all avoidable sets of partial words of size two
- On the Complexity of Deciding Avoidability of Sets of Partial Words
- Open problems on avoidable patterns in partial words
- Testing avoidability on sets of partial words is hard
- Two Element Unavoidable Sets of Partial Words
- Recurrent Partial Words and Representable Sets.
- Unavoidable sets of partial words of uniform length
- Number of holes in unavoidable sets of partial words. I.
- Number of holes in unavoidable sets of partial words. II.
- On the complexity of deciding avoidability of sets of partial words
This page was built for publication: Unavoidable sets of partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733729)
