Some improvements of the S-adic conjecture |
| |
Authors: | Julien Leroy |
| |
Affiliation: | Université de Picardie Jules Verne, Laboratoire Amiénois de Mathématiques Fondamentales et Appliquées, CNRS-UMR 6140, 33 rue Saint Leu, 80039 Amiens Cedex, France |
| |
Abstract: | In [S. Ferenczi, Rank and symbolic complexity, Ergodic Theory Dynam. Systems 16 (1996) 663-682], S. Ferenczi proved that the language of any uniformly recurrent sequence with an at most linear complexity is S-adic. In this paper we adapt his proof in a more structured way and improve this result stating that any such sequence is itself S-adic. We also give some properties on the constructed morphisms. |
| |
Keywords: | 68R-02 37B10 |
本文献已被 ScienceDirect 等数据库收录! |
|