Minimum complexity of automatic non sturmian sequences
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 29 (1995) no. 4, pp. 285-291.
@article{ITA_1995__29_4_285_0,
     author = {Tapsoba, T.},
     title = {Minimum complexity of automatic non sturmian sequences},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {285--291},
     publisher = {EDP-Sciences},
     volume = {29},
     number = {4},
     year = {1995},
     zbl = {0838.68057},
     mrnumber = {1359054},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1995__29_4_285_0/}
}
TY  - JOUR
AU  - Tapsoba, T.
TI  - Minimum complexity of automatic non sturmian sequences
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1995
DA  - 1995///
SP  - 285
EP  - 291
VL  - 29
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1995__29_4_285_0/
UR  - https://zbmath.org/?q=an%3A0838.68057
UR  - https://www.ams.org/mathscinet-getitem?mr=1359054
LA  - en
ID  - ITA_1995__29_4_285_0
ER  - 
%0 Journal Article
%A Tapsoba, T.
%T Minimum complexity of automatic non sturmian sequences
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1995
%P 285-291
%V 29
%N 4
%I EDP-Sciences
%G en
%F ITA_1995__29_4_285_0
Tapsoba, T. Minimum complexity of automatic non sturmian sequences. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Volume 29 (1995) no. 4, pp. 285-291. http://www.numdam.org/item/ITA_1995__29_4_285_0/

1. G. Christol, T. Kamae, M. Mendès-France, G. Rauzy, Suites algébriques, automates et substitutions, Bull. Soc. Math. France, 1980, 108, pp. 401-419. | Numdam | MR | Zbl

2. A. Cobham, Uniform Tag Sequences, Math. Syst. Theo, 1972, 6, pp. 164-192. | MR | Zbl

3. E. M. Coven, G. A. Hedlung, Sequences with minimal block groups, Math. Syst. Theo., 1973, 7, pp. 138-153. | MR | Zbl

4. C. Mauduit, Automates finis et ensembles normaux, Ann. Inst. Fourier, Grenoble, 1986, 36, 2, pp. 1-25. | Numdam | MR | Zbl

5. G. Rauzy, Suites à termes dans un alphabet fini, Sém. Théorie des nombres Bordeaux, 1982-1983, Exp. 35, pp. 1-16. | MR | Zbl

6. G. Rauzy, Rotation sur les groupes, nombres algébriques et substitutions, Sem. Théorie des nombres Bordeaux, 1987-1988, Exp. 21, pp. 1-12. | Zbl

7. T. Tapsoba, Complexité de suites automatiques, Thèse de troisième Cycle, Université d'Aix-Marseille II, 1987.

8. T. Tapsoba, Sur la factorisation des mots, Annales de l'Université de Ouagadougou, 1992, Série B, pp. 41-56.

9. T. Tapsoba, Special factors of automatic sequences, To appear in Journal of Pure and Applied Algebra. | MR | Zbl

10. T. Tapsoba, Automates calculant la complexité de suites automatiques, Journal de Théorie des nombres Bordeaux, 1994, 6, pp. 127-134. | EuDML | Numdam | MR | Zbl

11. A. Thue, Uber unendliche zeichenreihen, Norske Vid. Selsk. Skr., I. Mat. Nat. Kl, Christiana, 1906, 7, pp. 1-22. | JFM

12. A. Thue, Uber die gegenseitige Lage gleicher Teile genvisser zeichenreihen, Norske Vid. Selsk. Skr., I. Math. Nat Kl, Christiana, 1912, 1, pp. 1-67. | JFM