Intersecting periodic words

Authors:
Jamie Simpson
Affiliations:
Department of Mathematics and Statistics, Curtin University of Technology, GPO Box U1987, Perth, Western Australia 6845, Australia
Venue:
Theoretical Computer Science
Year:
2007

Citing 3
Cited 4

Fine and Wilf's theorem for three periods and a generalization of Sturmian words

Theoretical Computer Science
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture)

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
A new periodicity lemma

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching

How many runs can a string contain?

Theoretical Computer Science
The three squares lemma revisited

Journal of Discrete Algorithms
Computing regularities in strings: A survey

European Journal of Combinatorics
More results on overlapping squares

Journal of Discrete Algorithms

Quantified Score

Hi-index	5.23

Visualization

Abstract

Let a=a[1..2v] be a word which is a square and for which a[1..2u] is also a square and a[k+1..min(k+2w,2v)] has period w where u