Pages that link to "Item:Q3186679"
From MaRDI portal
The following pages link to A short proof that shuffle squares are 7-avoidable (Q3186679):
Displaying 5 items.
- On shuffling of infinite square-free words (Q2260629) (← links)
- Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126) (← links)
- On shuffled-square-free words (Q2680851) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- Non-constructive upper bounds for repetition thresholds (Q6661757) (← links)
