How Many Squares Can a String Contain?
- 30 April 1998
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 82 (1), 112-120
- https://doi.org/10.1006/jcta.1997.2843
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Squares, cubes, and time-space efficient string searchingAlgorithmica, 1995
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981
- On nonrepetitive sequencesJournal of Combinatorial Theory, Series A, 1974
- Uniqueness theorems for periodic functionsProceedings of the American Mathematical Society, 1965