Article contents
Palindromic complexity of infinite words associatedwith non-simple Parry numbers
Published online by Cambridge University Press: 12 March 2008
Abstract
We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over a binary alphabet, φ(0) = 0a1, φ(1) = 0b1, with a - 1 ≥ b ≥ 1, which are canonically associated with quadratic non-simple Parry numbers β.
- Type
- Research Article
- Information
- RAIRO - Theoretical Informatics and Applications , Volume 43 , Issue 1 , January 2009 , pp. 145 - 163
- Copyright
- © EDP Sciences, 2008
References
- 2
- Cited by