Theoretical Computer Science
Note: Testing avoidability on sets of partial words is hard
Theoretical Computer Science
Two element unavoidable sets of partial words
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Minimum number of holes in unavoidable sets of partial words of size three
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Number of holes in unavoidable sets of partial words I
Journal of Discrete Algorithms
| Hi-index | 5.23 |