منابع مشابه
Periods and Binary Words
We give an elementary short proof for a well-known theorem of Guibas and Odlyzko stating that the sets of periods of words are independent of the alphabet size. As a consequence of our constructing proof, we give a linear time algorithm which, given a word, computes a binary one with the same periods. We give also a very short proof for the famous Fine and Wilf's periodicity lemma.
متن کاملLocal periods and binary partial words: an algorithm
The study of the combinatorial properties of strings of symbols from a finite alphabet (also referred to as words) is profoundly connected to numerous fields such as biology, computer science, mathematics, and physics. Research in combinatorics on words goes back roughly a century. There is a renewed interest in combinatorics on words as a result of emerging new application areas such as molecu...
متن کاملPeriods, Capitalized Words, etc
In this article we present an approach for tackling three important aspects of text normalization: sentence boundary disambiguation, disambiguation of capitalized words in positions where capitalization is expected, and identification of abbreviations. As opposed to the two dominant techniques of computing statistics or writing specialized grammars, our document-centered approach works by consi...
متن کاملComputing Abelian Periods in Words
In the last couple of years many works have been devoted to Abelian complexity of words. Recently, Constantinescu and Ilie (Bulletin EATCS 89, 167–170, 2006) introduced the notion of Abelian period. We show that a word w of length n over an alphabet of size σ can have Θ(n2) distinct Abelian periods. However, to the best of our knowledge, no efficient algorithm is known for computing these perio...
متن کاملFine and Wilf Words for Any Periods
Let w = wt . ..w., be a word of maximal length n, and with a maximal number of distinct letters for this length, such that w has periods pt, . . ..pr but not period gcd(pt, . . ..pr). We provide a fast algorithm to compute n and w. We show that w is uniquely determined apart from isomorphism and that it is a palindrome. Furthermore we give lower and upper bounds for n as explicit functions of p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2000
ISSN: 0097-3165
DOI: 10.1006/jcta.1999.3014