@article{PDML_1985___2B_21_0, author = {Berstel, Jean}, title = {Some {Recent} {Results} on {Squarefree} {Words}}, journal = {Publications du D\'epartement de math\'ematiques (Lyon)}, pages = {21--36}, publisher = {Universit\'e Claude Bernard - Lyon 1}, number = {2B}, year = {1985}, mrnumber = {848821}, zbl = {0605.03015}, language = {en}, url = {http://archive.numdam.org/item/PDML_1985___2B_21_0/} }
Berstel, Jean. Some Recent Results on Squarefree Words. Publications du Département de mathématiques (Lyon), Compte rendu des journées infinitistes, no. 2B (1985), pp. 21-36. http://archive.numdam.org/item/PDML_1985___2B_21_0/
1 Quelques problèmes ouverts en théorie des langages algébriques. RAIRO Informatique théorique 13 (1979), 363-379. | Numdam | Zbl
, , , ,2 The Burnside problem and identities in groups", Ergeb. Math. Grenzgeb. vol. 95, Springer 1979. | MR | Zbl
,3 Optimal off-line detection of repetitions in a string, Theor. Comp. Sci. 22 (1983), 297-315. | MR | Zbl
, ,4 Advoidable patterns in strings of symbols, Pacific J. Math. 85 (1979), 261-294. | MR | Zbl
, , ,5 Uniformly growing K-th power-free homomorphisms, Theor. Comput. Sci. 23 (1983), 69-82. | MR | Zbl
,6 Non-repetitive sequences on three symbols, Quart. J. Math. Oxford (2) 34 (1983), 145-149. | MR | Zbl
7 Classification of noncounting events, J. Comp. Syst. Sci. 5 (1971), 41-53. | MR | Zbl
, , ,8 On the size of a square-free morphism on a three letter alphabet, Inf. Proc. Letters 16 (1983), 231-236. | MR | Zbl
,9 On generalized words of Thue-Morse, Techn. Report, Université Paris VI, L.I.P.T. 83-84. | Zbl
,10 Suites algébriques automates et substitutions, Bull. Soc. Math. France 108 (1980), 401-419. | Numdam | MR | Zbl
, , , ,11 An optimal algorithm for computing the repetitions in a word, Inf. Proc. Letters, 12 (1981), 244-250. | MR | Zbl
,12 Sharp characterizations of squarefree morphisms, Theor. Comp. Sci. 18 (1982), 221-226. | MR | Zbl
,13 Mots et morphismes sans carré, Annals of Discr. Math. 17 (1983), 235-245. | MR | Zbl
14 Recherche linéaire d'un carré dans un mot, C. R. Acad. Sci. Paris, 296 (1983) , 781-784. | MR | Zbl
,15 Sur un théorème de Thue, J. Combinatorial Theory 13 (1972), 90-99. | MR | Zbl
,16 Conditions enforcing regularity of context-free languages, Techn. Report, Boulder University, 1982. | MR | Zbl
, , ,17 Subword complexities of various classes of deterministic developmental languages without iteraction, Theor. Comput. Sci. 1 (1975), 59-75. | MR | Zbl
, , ,18 On the subword complexity of square-free DOL languages, Theor. Comp. Sci. 16 (1981), 25-32. | MR | Zbl
, ,19 Repetitions in homomorphisms and languages, 9th ICALP Symposium, Springer Lecture Notes in Computer Science 1982 192-196. | MR | Zbl
, ,20 On the separating power of EOL systems RAIRO Informatique 17 (1983), 13-22. | Numdam | MR | Zbl
, ,21 Topological Dynamics", American Math. Soc. Colloq. Pub. Vol. 36, 1955. | MR | Zbl
, , "22 Bounded AFLs, J. Comput. Syst. Sci. 12 (1976), 399-419. | MR | Zbl
,23 Generators and relations in groups - the Burnside problem in : T.L. Saaty (ed.), "Lectures in Modern Mathematics", Vol. II, John Wiley & Sons, 1964 , 42-92. | MR | Zbl
,24 Morphisms that avoid overlapping, University of Turku May 1983.
,25 Remarks on the work of Axel Thue on sentences, Nord. Mat. Tidskr 16 (1967), 148-1. | MR | Zbl
,26 On irreductible languages and non rational numbers, Bull. Mat. Soc. Sci. Mat. R. S. Roumanie 21 (1977), 301-308. | MR | Zbl
,27 On cube-free -words generated by binary morphisms, Discr. Appl. Math. 5 (1983), 279-297. | MR | Zbl
,28 A fine characterization of power-free morphisms, Techn. Report L.I.T.P. 1984. | Zbl
,29 Annihilators in non repetitive semi groups, Studies in Appl. Math. 55 (1976), 83-85. | Zbl
,30 Combinatorics on Words", Addison-Wesley 1983. | MR | Zbl
, "31 Permutations are not context-free : an application of the "Interchange Lemma", Inf. Proc. Letters 15 (1982), 68-71. | MR | Zbl
,32 An algorithm for recognizing repetition, Washington State University, Techn. Report CS-79-056.
, ,33 An algorithm for finding all repetitions in a string, J. Algorithms, 1983, to appear. | MR | Zbl
, ,34 A space-economical suffix tree construction algorithm J. Assoc. Mach. Comp. 23 (1976) 262-272. | MR | Zbl
35 Computations : finite and infinite machines", Prentice-Hall 1967. | MR | Zbl
, "36 Recurrent geodesics on a surface of negative curvature, Trans. Amer. Math. Soc. 22 (1921), 84-100. | JFM | MR
,37 Unending chess, symbolic dynamics and a problem in semigroups, Duke Math. J. 11 (1944), 1-7. | MR | Zbl
, ,38 Ann "Interchange lemma" for context-free languages, Washington State University, Techn. Report CS-81-080. | Zbl
, , ,39 The Morse sequence and iterated morphisms, Inf. Proc. Letters 12 (1981), 68-70. | MR | Zbl
,40 A propos d'une conjecture de F. Dejean sur les répétitions dans les mots, Discrete Appl. Math. | Zbl
,41 Nonrepetitive sequences, Proc. Cambridge Phil. Soc. 68 (1970) 267-274. | MR | Zbl
,42 On weakly square free words, Inf. Proc. Letters, to appear.
, ,43 A new characterization of the regular languages, 8th ICALP, Springer Lecture Notes in Computer Science 115, 1981, 175-183. | MR | Zbl
,44 Repetitive strings are not context-free, RAIRO Informatique théorique 16 (1982), 191-199. | Numdam | MR | Zbl
, ,45 Morphisms on free monoids and language theory, in : R. Book (ed.) : "Formal language theory : perpectives and open problems", Academic Press 1098, 141-166.
,46 Jewels of Formal Language Theory", Pitman 1981. | MR | Zbl
, "47 Morphismes itérés, mot de Morse et mot de Fibonacci, CR. Acad. Sci. Paris, 295 (1982), 439-441. | MR | Zbl
,48 Sur les morphismes qui engendrent des mots infinis ayant des facteurs prescrits, 6. GI Tagung Theoretische Informatik Lecture Notes Comp. Sci. 145, 1983, 301-311. | Zbl
,49 Sequences generated by infinitely iterated morphisms Techn. Report Université de Paris VII, L.I.T.P. 83-13. | Zbl
,50 Aperiodic words on three symbols, I, II, J. Reine Angew, Math. 321 (1981), 195-209, 327 (1981), 1-11. | MR | Zbl
,51 Aperiodic words on three symbols III, J. Reine Angew, Math. 330 (1982), 44-52. | MR | Zbl
, ,52 A stongly primitive word of arbitrary length ant its applications, Int. J. Comp. Math. A-6 (1970), 165-170. | MR | Zbl
,53 Determination in real time of all the periodicities in a word, Soviet Math. Dokl. 21 (1980), 392-395. | MR | Zbl
,54 Uber unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania (1906), 1-22. | JFM
,55 Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania (1912), 1-67. | JFM
,56 Linear pattern matching algorithms, Proc. 14 th Symp. switching automata theory, 1973. 1-11. | MR
,