Combinatorical and Algebraic Structures Seminar
Session details
| Date: | 27.10.2006 |
| Speaker: | Zuzana Masáková, FJFI, České vysoké učení technické |
| Title: | Factor complexity of infinite words invariant under substitution |
| Abstract: | The factor complexity of an infinite word $u$ is a function over ${\mathbb N}$ that counts the number of different blocks of length $n$ occurring in $u$. On the example of the fixed point of the canonical substitution of a Parry number we explain the tools and methods for determining the factor complexity of infinite words invariant under substitution. We introduce the notions of left and right special factor, bispecial factor, maximal left/right special factor and a infinite left/right special branch. We describe the tree of left special factors for the chosen infinite word and compute its factor complexity. |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož