Partial words and a theorem of Fine and Wilf revisited
نویسندگان
چکیده
A word of length n over a 1nite alphabet A is a map from {0; : : : ; n − 1} into A. A partial word of length n over A is a partial map from {0; : : : ; n− 1} into A. In the latter case, elements of {0; : : : ; n−1} without image are called holes (a word is just a partial word without holes). In this paper, we extend a fundamental periodicity result on words due to Fine and Wilf to partial words with two or three holes. This study was initiated by Berstel and Boasson for partial words with one hole. Partial words are motivated by molecular biology. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Interaction Properties of Relational Periods
Similarity relations, i.e., compatibility relations on words induced by relations on letters were introduced as a generalization of partial words in [9](i). There and in [10, 11] the main focus was on the effect of these relations on coding properties and on the defect theorem of words. In the article [8] we started the study of the interaction properties of periods with respect to similarity r...
متن کاملPartial Words and a Theorem of Fine and Wilf
A partial word is a word that is a partial mapping into an alphabet. We prove a variant of Fine and Wilf’s theorem for partial words, and give extensions of some general combinatorial properties of words. @ 1999 Elsevier Science B.V. All rights reserved.
متن کاملAbelian periods, partial words, and an extension of a theorem of Fine and Wilf
Recently, Constantinescu and Ilie proved a variant of the wellknown periodicity theorem of Fine and Wilf in the case of two relatively prime abelian periods and conjectured a result for the case of two nonrelatively prime abelian periods. In this paper, we answer some open problems they suggested. We show that their conjecture is false but we give bounds, that depend on the two abelian periods,...
متن کاملRelational Fine and Wilf words
We consider interaction properties of relational periods, where the relation is a compatibility relation on words induced by a relation on letters. By the famous theorem of Fine and Wilf, p + q − gcd(p, q) − 1 is the maximal length of a word having periods p and q but not period gcd(p, q). Such words of maximal length are called extremal Fine and Wilf words. In this paper we study properties of...
متن کاملFine and Wilf’s Theorem for Abelian Periods in Partial Words
Recently, Constantinescu and Ilie proved a variant of the well-known periodicity theorem of Fine and Wilf in the case of two relatively prime abelian periods, and conjectured a result for the case of two non-relatively prime abelian periods. More precisely, they proved that any full word having two coprime abelian periods p, q and length at least 2pq− 1 has also gcd(p, q) = 1 as a period. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 270 شماره
صفحات -
تاریخ انتشار 2002