Incremental computation of the set of period sets
Author:
- 14 March 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1073
Abstract
No abstract availableFunding Information
- Horizon 2020 Framework Programme
- H2020 Marie Skłodowska-Curie Actions (956229)
This publication has 26 references indexed in Scilit:
- A simple suboptimal construction of cross-bifix-free codesCryptography and Communications, 2013
- Combinatorics on partial word correlationsJournal of Combinatorial Theory, Series A, 2010
- Periodicity and repetitions in parameterized stringsDiscrete Applied Mathematics, 2008
- Generalised fine and Wilf's theorem for arbitrary number of periodsTheoretical Computer Science, 2005
- Periods and Binary WordsJournal of Combinatorial Theory, Series A, 2000
- Counting Distinct StringsAlgorithmica, 1999
- Monkey tests for random number generatorsComputers & Mathematics with Applications, 1993
- Approximate string-matching with q-grams and maximal matchesTheoretical Computer Science, 1992
- Periods in stringsJournal of Combinatorial Theory, Series A, 1981
- Periodicity and unbordered segments of wordsDiscrete Mathematics, 1979