Open problems on avoidable patterns in partial words
From MaRDI portal
Publication:5740407
zbMATH Open1341.68140MaRDI QIDQ5740407FDOQ5740407
Authors: F. Blanchet-Sadri 
Publication date: 26 July 2016
Recommendations
Cited In (11)
- Algorithmic combinatorics on partial words
- On avoidance of patterns of the form {\sigma}-{\tau} by words over a finite alphabet
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols
- Algorithmic Combinatorics on Partial Words
- Unavoidable sets of partial words
- Avoided strings in bacterial complete genomes and a related combinatorial problem
- Testing avoidability on sets of partial words is hard
- Unary Pattern Avoidance in Partial Words Dense with Holes
- Open problems on partial words
- Pattern avoidance in partial words over a ternary alphabet
- Van der Waerden's Theorem and Avoidability in 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)
