@article{PDML_1984___6B_A4_0, author = {Berstel, J.}, title = {Mots infinis}, journal = {Publications du D\'epartement de math\'ematiques (Lyon)}, pages = {89--102}, publisher = {Universit\'e Claude Bernard - Lyon 1}, number = {6B}, year = {1984}, mrnumber = {802633}, zbl = {0542.68068}, language = {fr}, url = {http://www.numdam.org/item/PDML_1984___6B_A4_0/} }
Berstel, J. Mots infinis. Publications du Département de mathématiques (Lyon), no. 6B (1984), pp. 89-102. http://www.numdam.org/item/PDML_1984___6B_A4_0/
[1] Avoidable patterns in strings of symbols, Pacific J. Math. 85 (1979), 261-294. | MR | Zbl
, , ,[2] Uniformly growing k-th power-free homomorphisms, Theor. Comput. Sci. 23 (1983), 69-82. | MR | Zbl
,[3] Non-repetitive sequences on three symbols, Quart. J. Math. Oxford (2) 34 (1983), 145-149. | MR | Zbl
,[4] On the size of a square-free morphism on a three letter alphabet, prepublication, 1983. | MR | Zbl
,[5] Sequences with minimal block growth, Math. Syst. Theory 7 (1973), 138-153. | MR | Zbl
, ,[6] Suites algébriques, automates et substitutions, Bull. Soc. Math. France 108 (1980), 401-419. | Numdam | MR | Zbl
, , , ,[7] Uniform tag sequences, Math. Systems. Th. 6 (1972), 164-192. | MR | Zbl
,[8] Sharp characterizations of squarefree morphisms, Theor. Comput. Sci. 18 (1982), 221-226. | MR | Zbl
,[9] Mots et morphismes sans carré, Annals of Discr. Math. 17 (1983), 235-245. | MR | Zbl
,[10] Régularités évitables, Thèse d'Etat, Rouen 1983.
,[11] Subword complexities of various classes of deterministic developmental languages without interaction, Theor. Comput. Sci. 1 (1975), 59-75. | MR | Zbl
, , ,[12] On the subword complexity of square-free DOL languages Theor. Comp. Sci. 16 (1981), 25-32. | MR | Zbl
, ,[13] Symbolic Dynamics II. Sturmian trajectories, American J. Math 62 (1940), 1-42. | JFM | MR
, ,[14] On irreductible languages and non rational numbers, Bull. Mat. Soc. Sci. Mat. R. S. Roumanie 21 (1977), 301-308. | MR | Zbl
,[15] On cube-free w-words generated by binary morphisms, Discr. Appl. Math 5 (1983), 279-297. | MR | Zbl
,[16] Combinatorics on Words", Addison-Wesley 1983. | MR | Zbl
, "[17] Permutations are not context-free : an application of the 'Interchange Lemma' Inf. Proc. Letters 15 (1982), 68-71. | MR | Zbl
,[18] Computations finite and infinite machines Prentice-Hall 1967. | MR | Zbl
,[19] Recurrent geodesics on a surface of negative curvature, Trans. Amer. Math. Soc. 22 (1921), 84-100. | JFM | MR
,[20] On weakly square free words, Inf. Proc. Letters, to appear.
, ,[21] Aperiodic words on three symbols, I, II, J. reine angew. Math. 321 (1981), 195-209, 327(1981), 1-11 | MR | Zbl
, ,Aperiodic words on three symbols, III, J. reine angew. Math., 330(1982), 44-52. | MR | Zbl
, ,[22] Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania (1906), 1-22. | JFM
,[23] Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania (1912), 1-67. | JFM
,