The following pages link to (Q4584890):
Displaying 12 items.
- Square-free words with square-free self-shuffles (Q405075) (← links)
- Infinite self-shuffling words (Q458277) (← links)
- Algorithmic and algebraic aspects of unshuffling permutations (Q1749534) (← links)
- Recognizing binary shuffle squares is \textsf{NP}-hard (Q2285126) (← links)
- Unshuffling a square is NP-hard (Q2637646) (← links)
- On recognising words that are squares for the shuffle product (Q2699216) (← links)
- The Shuffle Product: New Research Directions (Q2799163) (← links)
- On Shuffling a Word with its Letter-to-Letter Substitution (Q4988960) (← links)
- Long twins in random words (Q6065692) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Shuffle squares and reverse shuffle squares (Q6189690) (← links)
- Decision problems on copying and shuffling (Q6614538) (← links)
