Pages that link to "Item:Q3637218"
From MaRDI portal
The following pages link to On the Complexity of Deciding Avoidability of Sets of Partial Words (Q3637218):
Displaying 9 items.
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- Weak containment for partial words is coNP-complete (Q894455) (← links)
- Testing avoidability on sets of partial words is hard (Q1006080) (← links)
- The complexity of unavoidable word patterns (Q2158299) (← links)
- Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493) (← 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)