Pages that link to "Item:Q598457"
From MaRDI portal
The following pages link to Crucial words and the complexity of some extremal problems for sets of prohibited words (Q598457):
Displaying 14 items.
- Number of holes in unavoidable sets of partial words. I. (Q450546) (← links)
- Crucial words and the complexity of some extremal problems for sets of prohibited words (Q598457) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- On shortest crucial words avoiding abelian powers (Q968182) (← links)
- On uniquely \(k\)-determined permutations (Q2477375) (← links)
- Computing abelian complexity of binary uniform morphic words (Q2629230) (← links)
- Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three (Q3000493) (← links)
- Elementariness of a finite set of words is co-NP-complete (Q3484360) (← links)
- Crucial Words for Abelian Powers (Q3637231) (← links)
- The Restricted Word Shadow Problem (Q4915245) (← links)
- (Q5016356) (← links)
- Unavoidable sets (Q5920633) (← links)
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group (Q6097068) (← links)
- Counting crucial permutations with respect to monotone patterns (Q6117352) (← links)