Generalised fine and Wilf's theorem for arbitrary number of periods

Authors:
Sorin Constantinescu;Lucian Ilie
Affiliations:
Department of Computer Science, University of Western Ontario, London, Ont., Canada N6A 5B7;Department of Computer Science, University of Western Ontario, London, Ont., Canada N6A 5B7
Venue:
Theoretical Computer Science - Combinatorics on words
Year:
2005

Citing 7
Cited 10

Combinatorics of words

Handbook of formal languages, vol. 1
Fine and Wilf's theorem for three periods and a generalization of Sturmian words

Theoretical Computer Science
Partial words and a theorem of Fine and Wilf

Theoretical Computer Science
Partial words and a theorem of Fine and Wilf revisited

Theoretical Computer Science
Introduction to Algorithms

Introduction to Algorithms
On Fine and Wilf's theorem for bidimensional words

Theoretical Computer Science
Periodicity, morphisms, and matrices

Theoretical Computer Science - Mathematical foundations of computer science

Graph connectivity, partial words, and a theorem of Fine and Wilf

Information and Computation
Periodicity properties on partial words

Information and Computation
On a Special Class of Primitive Words

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Fine and Wilf words for any periods II

Theoretical Computer Science
On a special class of primitive words

Theoretical Computer Science
An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality

Fundamenta Informaticae
Periods in partial words: an algorithm

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Pseudoperiodic words

DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Periods in partial words: An algorithm

Journal of Discrete Algorithms
Fine and wilf's theorem and pseudo-repetitions

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The well known Fine and Wilf's theorem for words states that if a word has two periods and its length is at least as long as the sum of the two periods minus their greatest common divisor, then the word also has as period the greatest common divisor. We generalise this result for an arbitrary number of periods. Our bound is strictly better in some cases than previous generalisations. Moreover, we prove it optimal. We show also that any extrenal word is unique up to letter renaming and give an algorithm to compute both the bound and a corresponding extremal word.