spacer
EDP Sciences Journals List
Home arrow Document
Subscriber Authentication Point
 
About the journal
Author information
Subscriber information
Reader's services
Events
  
 Previous article
Next article 
   Table of contents

|   Abstract  |   PDF (256.5 KB)  |

RAIRO-Theor. Inf. Appl. (2008)
DOI: 10.1051/ita:2008005

Palindromic complexity of infinite words associated with non-simple Parry numbers

L'ubomíra Balková and Zuzana Masáková

Doppler Institute for Mathematical Physics and Applied Mathematics & Department of Mathematics, FNSPE, Czech Technical University, Trojanova 13, 120 00 Praha 2, Czech Republic; l.balkova@centrum.cz; masakova@km1.fjfi.cvut.cz


(Received November 15, 2006. Accepted January 30, 2008. Published online 12 March 2008.)

Abstract
We study the palindromic complexity of infinite words $u_\beta$, the fixed points of the substitution over a binary alphabet, $\varphi$(0) = 0a1, $\varphi$(1) = 0b1, with a-1 $\geq$ b $\geq$ 1, which are canonically associated with quadratic non-simple Parry numbers $\beta$.


Mathematics Subject Classification. 68R15, 11A63

Key words: Palindromes -- beta-expansions -- infinite words


© EDP Sciences 2008