Greedy Palindromic Lengths

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Greedy palindromic lengths

In [A. Frid, S. Puzynina, L.Q. Zamboni, On palindromic factorization of words, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately periodic. We introduce variants of this conjecture and prove this conjecture in particular cases. Especially we introduce left and right greedy palindromic lengths. These l...

متن کامل

Palindromic Permutations and Generalized Smarandache Palindromic Permutations

The idea of left(right) palindromic permutations(LPPs,RPPs) and left(right) generalized Smarandache palindromic permutations(LGSPPs,RGSPPs) are introduced in symmetric groups Sn of degree n. It is shown that in Sn, there exist a LPP and a RPP and they are unique(this fact is demonstrated using S2 and S3). The dihedral group Dn is shown to be generated by a RGSPP and a LGSPP(this is observed to ...

متن کامل

Palindromic Richness

In this paper, we study combinatorial and structural properties of a new class of finite and infinite words that are ‘rich’ in palindromes in the utmost sense. A characteristic property of so-called rich words is that all complete returns to any palindromic factor are themselves palindromes. These words encompass the well-known episturmian words, originally introduced by the second author toget...

متن کامل

Palindromic Differences

Let x denote a positive integer, written in the ordinary denary form, and define its palindromic inverse x T to be the integer obtained from x by writing its digits in reverse order. We ignore leading zeros so that both 1234 and 12340 have palindromic inverse 4321. A number is called a palindrome if x = x f. Similar definitions apply to bases other than 10. A notorious problem concerns palindro...

متن کامل

Palindromic protection

JCB • VOLUME 167 • NUMBER 4 • 2004 580 Palindromic protection esearch from Laura Maringele and David Lydall (University of Newcastle, UK) shows that yeast find a way to survive in the absence of telomeres. By forming large palindromes at chromosome ends, yeast mutants proliferate for many generations despite genomic instability, possibly becoming the yeast equivalent of cancer cells. Chromosome...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Foundations of Computer Science

سال: 2018

ISSN: 0129-0541,1793-6373

DOI: 10.1142/s0129054118500077