Pages that link to "Item:Q606993"
From MaRDI portal
The following pages link to On the complexity of deciding avoidability of sets of partial words (Q606993):
Displaying 11 items.
- Number of holes in unavoidable sets of partial words. II. (Q450549) (← links)
- Weak containment for partial words is coNP-complete (Q894455) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- On universal partial words (Q1689916) (← links)
- The complexity of unavoidable word patterns (Q2158299) (← links)
- Van der Waerden's Theorem and Avoidability in Words (Q3081580) (← links)
- (Q3410941) (← links)
- On the Computational Complexity of Partial Word Automata Problems (Q4589235) (← links)
- (Q4608614) (← links)
- (Q5016356) (← links)
- Computational and Proof Complexity of Partial String Avoidability (Q5061883) (← links)