Periodicity properties on partial words

Authors:
F. Blanchet-Sadri;Kevin Corcoran;Jenell Nyberg
Affiliations:
University of North Carolina, Department of Computer Science, P.O. Box 26170, Greensboro, NC 27402-6170, USA;University of Missouri Columbia, Department of Computer Science, Columbia, MO 65211, USA;University of Iowa, Department of Mathematics, Iowa City, IA 52242-1419, USA
Venue:
Information and Computation
Year:
2008

Citing 11
Cited 0

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
Periods and binary words

Journal of Combinatorial Theory Series A
Partial words and a theorem of Fine and Wilf revisited

Theoretical Computer Science
Local periods and binary partial words: an algorithm

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

Theoretical Computer Science - Combinatorics on words
Primitive partial words

Discrete Applied Mathematics
Testing primitivity on partial words

Discrete Applied Mathematics
Graph connectivity, partial words, and a theorem of Fine and Wilf

Information and Computation
Correlations of partial words

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of periodicity has played over the years a central role in the development of combinatorics on words and has been a highly valuable tool for the design and analysis of algorithms. Fine and Wilf's famous periodicity result, which is one of the most used and known results on words, has extensions to partial words, or sequences that may have a number of ''do not know'' symbols. These extensions fall into two categories: the ones that relate to strong periodicity and the ones that relate to weak periodicity. In this paper, we obtain consequences by generalizing, in particular, the combinatorial property that ''for any word u over {a, b}, ua or ub is primitive,'' which proves in some sense that there exist very many primitive partial words.