On shuffled-square-free words
From MaRDI portal
Publication:2680851
DOI10.1016/j.tcs.2022.10.028OpenAlexW4307568290MaRDI QIDQ2680851
Vincent Jugé, Stéphane Vialette, Laurent Bulteau
Publication date: 4 January 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.028
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Growth properties of power-free languages
- Generating square-free words efficiently
- An optimal algorithm for computing the repetitions in a word
- Optimal off-line detection of repetitions in a string
- How many squares must a binary sequence contain?
- Recognizing binary shuffle squares is \textsf{NP}-hard
- Extremal square-free words
- A note on the number of squares in a word
- Unshuffling a square is NP-hard
- On recognising words that are squares for the shuffle product
- A short proof that shuffle squares are 7-avoidable
- An O(n log n) algorithm for finding all repetitions in a string
- Lengths of extremal square-free ternary words.
- Handbook of Enumerative Combinatorics
This page was built for publication: On shuffled-square-free words
