RAIRO-Theor. Inf. Appl.
Volume 44, Number 1, January-March 2010Special issue dedicated to the 12th "Journées Montoises d'Informatique Théorique"
|Page(s)||125 - 138|
|Published online||11 February 2010|
On the number of squares in partial words
Department of Mathematics and Turku Centre for Computer Science, University of Turku, 20014 Turku, Finland;
firstname.lastname@example.org, email@example.com, firstname.lastname@example.org
2 Institute of Mathematics, University of Liège, Grand Traverse 12 (B 37), 4000 Liège, Belgium.
The theorem of Fraenkel and Simpson states that the maximum number of distinct squares that a word w of length n can contain is less than 2n. This is based on the fact that no more than two squares can have their last occurrences starting at the same position. In this paper we show that the maximum number of the last occurrences of squares per position in a partial word containing one hole is 2k, where k is the size of the alphabet. Moreover, we prove that the number of distinct squares in a partial word with one hole and of length n is less than 4n, regardless of the size of the alphabet. For binary partial words, this upper bound can be reduced to 3n.
Mathematics Subject Classification: 68R15.
Key words: Square / partial word / theorem of Fraenkel and Simpson.
© EDP Sciences, 2010
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.