On recognising words that are squares for the shuffle product
From MaRDI portal
Publication:2699216
DOI10.1016/j.tcs.2017.04.003OpenAlexW2606653363MaRDI QIDQ2699216
Romeo Rizzi, Stéphane Vialette
Publication date: 26 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.04.003
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of iterated shuffle
- Improved algorithms for largest cardinality 2-interval pattern problem
- On two open problems of 2-interval patterns
- Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words)
- Efficient recognition of rational relations
- On the computational complexity of a merge recognition problem
- Reconstructing a history of recombinations from a set of sequences
- A note on decidability questions on presentations of word semigroups
- On the computational complexity of 2-interval pattern matching problems
- A regularity lemma and twins in words
- Unshuffling a square is NP-hard
- Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model
- The Complexity of Some Problems on Subsequences and Supersequences
- On Recognizing Words That Are Squares for the Shuffle Product
This page was built for publication: On recognising words that are squares for the shuffle product
