Mots sans répétitions et langages rationnels bornés
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1977)
- Volume: 11, Issue: 3, page 197-202
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 1. F. DEJEAN, Sur un Théorème de Thue. Journal of Combinatorial Theory (A),13, 1972, 99-99. Zbl0245.20052MR300959
- 2. S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, 1974. Zbl0317.94045MR530382
- 3. S. GlNSBURG and E. H. SPANIER, Bounded ALGOL-like Languages, Trans. American Math. Soc.,113, 1964, 333-368. Zbl0142.24803MR181500
- 4. S. GINSBURG and E. H. SPANIER, Bounded Regular Sets, Proc. American Math. Soc., 17, 1966, 1043-1049. Zbl0147.25301MR201310
- 5. G. TH. GUILBAUD et J. GARDELLE, Cadences, Mathématiques et Sciences Humaines, 9, 1964, 31-38.
- 6. A. RESTIVO, A Characterization of Bounded Regular Sets, 2nd GI Conference on Automata Theory and Formal Languages, Lecture Notes in Computer Science, 33, 1975, 239-244. Zbl0346.68039MR431807
- 7. A. THUE, Über diegegenseitige Lage gleicher Teile gewisser Zeichenreihen, Skr. Vid. Kristiania I Mat. Naturv. Klasse 1, 1912, 1-67. JFM44.0462.01