Name
Abstract | ||
|---|---|---|
In this paper we prove that for any infinite word w whose set of factors is closed under reversal, the following conditions are equivalent:(I)all complete returns to palindromes are palindromes; (II)P(n)+P(n+1)=C(n+1)-C(n)+2 for all n, where P (resp. C) denotes the palindromic complexity (resp. factor complexity) function of w, which counts the number of distinct palindromic factors (resp. factors) of each length in w. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.aam.2008.03.005 | Clinical Orthopaedics and Related Research |
Keywords | Field | DocType |
palindromic complexity,rauzy graph,following condition,complete return,distinct palindromic factor,factor complexity,rich word.,palindrome,return word,infinite word w,discrete mathematics | Discrete mathematics,Combinatorics,Palindromic number,Palindrome,Mathematics | Journal |
Volume | Issue | ISSN |
42 | 1 | Advances In Applied Mathematics 42 (2009) 60--74 |
Citations | PageRank | References |
26 | 1.65 | 13 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michelangelo Bucci | 1 | 105 | 10.62 |
| Alessandro De Luca | 2 | 42 | 2.92 |
| Amy Glen | 3 | 121 | 9.48 |
| Luca Q. Zamboni | 4 | 253 | 27.58 |