A note on the number of squares in a word
Author:
- 1 June 2007
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 380 (3) , 373-376
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A simple proof that a word of length n has at most 2n distinct squaresJournal of Combinatorial Theory, Series A, 2005
- Applied Combinatorics on Words2005
- Linear time algorithms for finding and representing all the tandem repeats in a stringJournal of Computer and System Sciences, 2004
- Finding maximal repetitions in a word in linear time2003
- How Many Squares Can a String Contain?Journal of Combinatorial Theory, Series A, 1998
- Squares, cubes, and time-space efficient string searchingAlgorithmica, 1995
- An optimal algorithm for computing the repetitions in a wordInformation Processing Letters, 1981