Combinatorical and Algebraic Structures Seminar
Session details
| Date: | 12.5.2006 |
| Speaker: | Edita Pelantová, FNSPE, Czech Technical University |
| Title: | Factor complexity of infinite words associated with non-simple Parry numbers |
| Abstract: | We study the fixed point $u_\beta$ of the canonical substitution associated with $\beta$-expansions. For a non-simple Parry number $\beta$ we determine the structure of infinite left special branches, which are an important tool for the computation of the complexity of $u_\beta$. We derive an explicit formula for the complexity of $u_\beta$ when $\beta$ is a quadratic Parry number. This is a continuation of two previous lectures by P.~Ambro\v{z} and \v{L}.~Balkov\'a. |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož