Journal article
A connection between palindromic and factor complexity using return words
Advances in Applied Mathematics, Vol.42(1), pp.60-74
2009
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.
Details
- Title
- A connection between palindromic and factor complexity using return words
- Authors/Creators
- M. Bucci (Author/Creator) - University of Naples Federico IIA. Deluca (Author/Creator)A. Glen (Author/Creator) - Université du Québec à MontréalL. Zamboni (Author/Creator) - Université de Lyon
- Publication Details
- Advances in Applied Mathematics, Vol.42(1), pp.60-74
- Publisher
- Academic Press
- Identifiers
- 991005542096307891
- Copyright
- 2008 Elsevier Inc.
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Journal article
Metrics
261 File views/ downloads
101 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Collaboration types
- Domestic collaboration
- International collaboration
- Citation topics
- 9 Mathematics
- 9.28 Pure Maths
- 9.28.534 Dynamical Systems
- Web Of Science research areas
- Mathematics, Applied
- ESI research areas
- Mathematics