Open Access
- 4 April 2025
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1041
Abstract
No abstract availableFunding Information
- National Science Centre Poland (2018/31/D/ST6/03991)
This publication has 14 references indexed in Scilit:
- On recognising words that are squares for the shuffle productTheoretical Computer Science, 2023
- Searching of gapped repeats and subrepetitions in a wordJournal of Discrete Algorithms, 2017
- Fast Algorithm for Partial Covers in WordsAlgorithmica, 2014
- Unshuffling a square is NP-hardJournal of Computer and System Sciences, 2014
- Growth of Power-Free Languages over Large AlphabetsTheory of Computing Systems, 2013
- Enhanced string coveringTheoretical Computer Science, 2013
- A correction to “An optimal algorithm to compute all the covers of a string”Information Processing Letters, 1995
- An on-line string superprimitivity testInformation Processing Letters, 1992
- Optimal superprimitivity testing for stringsInformation Processing Letters, 1991
- On the complexity of iterated shuffleJournal of Computer and System Sciences, 1984