Minimum complexity of automatic non sturmian sequences
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1995)
- Volume: 29, Issue: 4, page 285-291
- ISSN: 0988-3754
Access Full Article
top
How to cite
topTapsoba, T.. "Minimum complexity of automatic non sturmian sequences." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 29.4 (1995): 285-291. <http://eudml.org/doc/92510>.
@article{Tapsoba1995,
author = {Tapsoba, T.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {automatic non Sturmian sequences},
language = {eng},
number = {4},
pages = {285-291},
publisher = {EDP-Sciences},
title = {Minimum complexity of automatic non sturmian sequences},
url = {http://eudml.org/doc/92510},
volume = {29},
year = {1995},
}
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
PB - EDP-Sciences
VL - 29
IS - 4
SP - 285
EP - 291
LA - eng
KW - automatic non Sturmian sequences
UR - http://eudml.org/doc/92510
ER -
References
top- 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. Zbl0472.10035MR614317
- 2. A. COBHAM, Uniform Tag Sequences, Math. Syst. Theo, 1972, 6, pp. 164-192. Zbl0253.02029MR457011
- 3. E. M. COVEN, G. A. HEDLUNG, Sequences with minimal block groups, Math. Syst. Theo., 1973, 7, pp. 138-153. Zbl0256.54028MR322838
- 4. C. MAUDUIT, Automates finis et ensembles normaux, Ann. Inst. Fourier, Grenoble, 1986, 36, 2, pp. 1-25. Zbl0576.10026MR850740
- 5. G. RAUZY, Suites à termes dans un alphabet fini, Sém. Théorie des nombres Bordeaux, 1982-1983, Exp. 35, pp. 1-16. Zbl0547.10048MR750326
- 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. Zbl0726.11019
- 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. Zbl0856.11012MR1384008
- 10. T. TAPSOBA, Automates calculant la complexité de suites automatiques, Journal de Théorie des nombres Bordeaux, 1994, 6, pp. 127-134. Zbl0815.11015MR1305291
- 11. A. THUE, Uber unendliche zeichenreihen, Norske Vid. Selsk. Skr., I. Mat. Nat. Kl, Christiana, 1906, 7, pp. 1-22. JFM37.0066.17
- 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. JFM44.0462.01
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.