Mathematics – Combinatorics
Scientific paper
2006-11-16
Mathematics
Combinatorics
16 pages
Scientific paper
We study the palindromic complexity of infinite words $u_\beta$, the fixed
points of the substitution over a binary alphabet, $\phi(0)=0^a1$,
$\phi(1)=0^b1$, with $a-1\geq b\geq 1$, which are canonically associated with
quadratic non-simple Parry numbers $\beta$.
Balková L'ubom{\'ı}ra
Masáková Zuzana
No associations
LandOfFree
Palindromic complexity of infinite words associated with non-simple Parry numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Palindromic complexity of infinite words associated with non-simple Parry numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Palindromic complexity of infinite words associated with non-simple Parry numbers will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-623305