Pages that link to "Item:Q1006080"
From MaRDI portal
The following pages link to Testing avoidability on sets of partial words is hard (Q1006080):
Displaying 5 items.
- 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)
- Unavoidable sets of partial words (Q733729) (← links)
- Weak containment for partial words is coNP-complete (Q894455) (← links)
- Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493) (← links)
