. C O ] 1 4 Ju n 20 01 Palindrome complexity
نویسندگان
چکیده
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P” of Hof-Knill-Simon. We also give an upper bound for the palindrome complexity of a sequence in terms of its (block-)complexity.
منابع مشابه
1 4 Ju n 20 01 Palindrome complexity
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P” of Hof-Knill-Simon. We also give ...
متن کاملar X iv : h ep - p h / 01 06 15 6 v 1 1 4 Ju n 20 01 On the d / u Asymmetry and Parton Distributions
We discuss the impact of different measurements of the d/u asymmetry in the extraction of parameterizations of parton distribution functions.
متن کامل4 v 1 2 8 Ju n 20 01 Anderson Theorem for Color Superconductor
Ginzburg-Landau functional is derived for a system possessing both chiral and diquark condensates. Anderson theorem for such a system is formulated and proved.
متن کاملar X iv : h ep - p h / 01 06 21 1 v 1 1 9 Ju n 20 01 Interference effects in the decay φ → π 0 π 0 γ and the coupling constant g
متن کامل
- th / 0 10 60 60 v 1 2 6 Ju n 20 01 1 A ( e , e ′ p ) reactions at GeV energies
An unfactorized and relativistic framework for calculating A(e, e ′ p) observables at typical JLAB energies is presented. Results of (e, e ′ p) model calculations for the target nuclei 12 C and 16 O are presented and compared to data from SLAC and JLAB.
متن کامل