کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10334739 | 690570 | 2005 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Generalised fine and Wilf's theorem for arbitrary number of periods
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Generalised fine and Wilf's theorem for arbitrary number of periods Generalised fine and Wilf's theorem for arbitrary number of periods](/preview/png/10334739.png)
چکیده انگلیسی
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 extremal word is unique up to letter renaming and give an algorithm to compute both the bound and a corresponding extremal word.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 339, Issue 1, 11 June 2005, Pages 49-60
Journal: Theoretical Computer Science - Volume 339, Issue 1, 11 June 2005, Pages 49-60
نویسندگان
Sorin Constantinescu, Lucian Ilie,