The following pages link to Unavoidable sets of partial words (Q733729):
Displaying 9 items.
- Number of holes in unavoidable sets of partial words. I. (Q450546) (← links)
- Number of holes in unavoidable sets of partial words. II. (Q450549) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- On universal partial words (Q1689916) (← links)
- Universal partial words over non-binary alphabets (Q1694683) (← links)
- Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493) (← links)
- On the Complexity of Deciding Avoidability of Sets of Partial Words (Q3637218) (← links)
- (Q5016356) (← links)
