Open problems on avoidable patterns in partial words
From MaRDI portal
Publication:5740407
Recommendations
Cited in
(11)- Algorithmic combinatorics on partial words
- Pattern avoidance in partial words over a ternary alphabet
- Open problems on partial words
- Unary Pattern Avoidance in Partial Words Dense with Holes
- Testing avoidability on sets of partial words is hard
- Avoided strings in bacterial complete genomes and a related combinatorial problem
- Van der Waerden's Theorem and Avoidability in Words
- On avoidance of patterns of the form {\sigma}-{\tau} by words over a finite alphabet
- Unavoidable sets of partial words
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
- Algorithmic Combinatorics on Partial Words
This page was built for publication: Open problems on avoidable patterns in partial words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740407)
