Mots sans repetitions et langages rationnels bornes. (French) Zbl 0371.68023


68Q45 Formal languages and automata
20M05 Free semigroups, generators and relations, word problems
20M35 Semigroups in automata theory, linguistics, etc.
Full Text: EuDML


[1] 1. F. DEJEAN, Sur un Théorème de Thue. Journal of Combinatorial Theory (A),13, 1972, 99-99. Zbl0245.20052 MR300959 · Zbl 0245.20052
[2] 2. S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, 1974. Zbl0317.94045 MR530382 · Zbl 0317.94045
[3] 3. S. GlNSBURG and E. H. SPANIER, Bounded ALGOL-like Languages, Trans. American Math. Soc.,113, 1964, 333-368. Zbl0142.24803 MR181500 · Zbl 0142.24803
[4] 4. S. GINSBURG and E. H. SPANIER, Bounded Regular Sets, Proc. American Math. Soc., 17, 1966, 1043-1049. Zbl0147.25301 MR201310 · Zbl 0147.25301
[5] 5. G. TH. GUILBAUD et J. GARDELLE, Cadences, Mathématiques et Sciences Humaines, 9, 1964, 31-38.
[6] 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.68039 MR431807 · Zbl 0346.68039
[7] 7. A. THUE, Über diegegenseitige Lage gleicher Teile gewisser Zeichenreihen, Skr. Vid. Kristiania I Mat. Naturv. Klasse 1, 1912, 1-67. JFM44.0462.01 · JFM 43.0162.07
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.