Pages that link to "Item:Q4928489"
From MaRDI portal
The following pages link to On Recognizing Words That Are Squares for the Shuffle Product (Q4928489):
Displaying 11 items.
- Square-free words with square-free self-shuffles (Q405075) (← links)
- Infinite self-shuffling words (Q458277) (← links)
- Square-free shuffles of words (Q496046) (← links)
- On the complexity and decidability of some problems involving shuffle (Q1706154) (← links)
- Algorithmic and algebraic aspects of unshuffling permutations (Q1749534) (← links)
- String shuffle: circuits and graphs (Q2018545) (← 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)
- Subsequence covers of words (Q6166966) (← links)