| Abstract: |
| A $\mathcal{S}$-adic subshift is a subshift generated by a sequence of morphisms between (eventually different), finite alphabets. I will show some recent ideas developed in a joint work with F. Durand, S. Petite and A. Maass to give upper bounds for the complexity of $\mathcal{S}$-adic subshifts.
If time permits, I will mention some applications. For instance we give conditions so that a $\mathcal{S}$-adic subshift has a sublinear complexity. |
|