Minimum complexity of automatic non sturmian sequences
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 29 (1995) no. 4, pp. 285-291.

Voir la notice de l'article dans Numdam

@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 = {https://geodesic-test.mathdoc.fr/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
SP  - 285
EP  - 291
VL  - 29
IS  - 4
PB  - EDP-Sciences
UR  - https://geodesic-test.mathdoc.fr/item/ITA_1995__29_4_285_0/
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
%U https://geodesic-test.mathdoc.fr/item/ITA_1995__29_4_285_0/
%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, Tome 29 (1995) no. 4, pp. 285-291. https://geodesic-test.mathdoc.fr/item/ITA_1995__29_4_285_0/