{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:07Z","timestamp":1725663367364},"publisher-location":"Berlin, Heidelberg","reference-count":56,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540129202"},{"type":"electronic","value":"9783540388050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-12920-0_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:58:32Z","timestamp":1330192712000},"page":"14-25","source":"Crossref","is-referenced-by-count":15,"title":["Some recent results on squarefree words"],"prefix":"10.1007","author":[{"given":"Jean","family":"Berstel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1051\/ita\/1979130403631","volume":"13","author":"J. Autebert","year":"1979","unstructured":"Autebert J., J. Beauquier, L. Boasson, M. Nivat, Quelques probl\u00e8mes ouverts en th\u00e9orie des langages alg\u00e9briques, RAIRO Informatique th\u00e9orique 13(1979), 363\u2013379.","journal-title":"RAIRO Informatique th\u00e9orique"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Adjan S., \"The Burnside problem and identities in groups\", Ergeb. Math. Grenzgeb. vol 95, Springer 1979.","DOI":"10.1007\/978-3-642-66932-3"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(83)90109-3","volume":"22","author":"A. Apostolico","year":"1983","unstructured":"Apostolico A., F. Preparata, Optimal off-line detection of repetitions in a string, Theor. Comp. Sci 22(1983), 297\u2013315.","journal-title":"Theor. Comp. Sci"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","volume":"85","author":"D. Bean","year":"1979","unstructured":"Bean D., A. Ehrenfeucht, G. McNulty, Avoidable patterns in strings of symbols, Pacific J. Math. 85(1979), 261\u2013294.","journal-title":"Pacific J. Math."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0304-3975(88)90009-6","volume":"23","author":"F. Brandenburg","year":"1983","unstructured":"Brandenburg F., Uniformly growing k-th power-free homomorphisms, Theor. Comput. Sci. 23(1983), 69\u201382.","journal-title":"Theor. Comput. Sci."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1093\/qmath\/34.2.145","volume":"34","author":"J. Brinkhuis","year":"1983","unstructured":"Brinkhuis J., Non-repetitive sequences on three symbols, Quart. J. Math. Oxford(2) 34(1983), 145\u2013149.","journal-title":"Quart. J. Math. Oxford(2)"},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0022-0000(71)80006-5","volume":"5","author":"J. Brzozowski","year":"1971","unstructured":"Brzozowski J., K. Culik II, A. Gabrielian, Classification of noncounting events, J. Comp. Syst, Sci. 5(1971), 41\u201353.","journal-title":"J. Comp. Syst, Sci."},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0190(83)90094-7","volume":"16","author":"A. Carpi","year":"1983","unstructured":"Carpi A., On the size of a square-free morphism on a three letter alphabet, Inf. Proc. Letters 16(1983), 231\u2013236.","journal-title":"Inf. Proc. Letters"},{"key":"2_CR9","unstructured":"Cerny A., On generalized words of Thue-Morse, Techn. Report, Universite Paris VI, L.I.T.P. 83-44."},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"401","DOI":"10.24033\/bsmf.1926","volume":"108","author":"C. Christol","year":"1980","unstructured":"Christol C., T. Kamae, M. Mend\u00e8s-France, G. Rauzy, Suites alg\u00e9briques, automates et substitutions, Bull. Soc. Math. France 108 (1980), 401\u2013419.","journal-title":"Bull. Soc. Math. France"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M. Crochemore","year":"1981","unstructured":"Crochemore M., An optimal algorithm for computing the repetitions in a word, Inf. Proc. Letters, 12(1981), 244\u2013250.","journal-title":"Inf. Proc. Letters"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(82)90023-8","volume":"18","author":"M. Crochemore","year":"1982","unstructured":"Crochemore M., Sharp characterizations of squarefree morphisms, Theor. Comp. Sci. 18(1982), 221\u2013226.","journal-title":"Theor. Comp. Sci."},{"key":"2_CR13","first-page":"235","volume":"17","author":"M. Crochemore","year":"1983","unstructured":"Crochemore M., Mots et morphismes sans carr\u00e9, Annals of Discr. Math. 17(1983), 235\u2013245.","journal-title":"Annals of Discr. Math."},{"key":"2_CR14","first-page":"781","volume":"296","author":"M. Crochemore","year":"1983","unstructured":"Crochemore M., Recherche lin\u00e9aire d'un carr\u00e9 dans un mot, C. R. Acad. Sci. Paris, 296(1983), 781\u2013784.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F. Dejean","year":"1972","unstructured":"Dejean F., Sur un th\u00e9or\u00e8me de Thue, J. Combinatorial Theory 13(1972), 90\u201399.","journal-title":"J. Combinatorial Theory"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Ehrenfeucht A., D. Haussler, G. Rozenberg, Conditions enforcing regularity of context-free languages, Techn. Report, Boulder University, 1982.","DOI":"10.1007\/BFb0012768"},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(75)90012-2","volume":"1","author":"A. Ehrenfeucht","year":"1975","unstructured":"Ehrenfeucht A., K. Lee, G. Rozenberg, Subword complexities of various classes of deterministic developmental languages without interaction, Theor. Comput. Sci. 1(1975), 59\u201375.","journal-title":"Theor. Comput. Sci."},{"key":"2_CR18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(81)90028-1","volume":"16","author":"A. Ehrenfeucht","year":"1981","unstructured":"Ehrenfeucht A., G. Rozenberg, On the subword complexity of square-free DOL languages, Theor. Comp. Sci. 16(1981), 25\u201332.","journal-title":"Theor. Comp. Sci."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Ehrenfeucht A., G. Rozenberg, Repetitions in homomorphisms and languages, 9th ICALP Symposium, Springer Lecture Notes in Computer Science 1982, 192\u2013196.","DOI":"10.1007\/BFb0012769"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1051\/ita\/1983170100131","volume":"17","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht A., G. Rozenberg, On the separating power of EOL systems, RAIRD Informatique 17(1983), 13\u201322.","journal-title":"RAIRD Informatique"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Gottschalk W. G.Hedlund, \"Topological Dynamics\", American Math. Soc. Colloq. Pub. Vol. 36, 1955.","DOI":"10.1090\/coll\/036"},{"key":"2_CR22","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1016\/S0022-0000(76)80010-4","volume":"12","author":"J. Goldstine","year":"1976","unstructured":"Goldstine J., Bounded AFLs, J. Comput. Syst. Sci. 12(1976), 399\u2013419.","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR23","unstructured":"Hall M., Generators and relations in groups \u2014 the Burnside problem, in: T.L. Saaty (ed.), \"Lectures in Modern Mathematics\", Vol. II, John Wiley & Sons, 1964, 42\u201392."},{"key":"2_CR24","unstructured":"Harju T., Morphisms that avoid overlapping, University of Turku, May 1983."},{"key":"2_CR25","first-page":"148","volume":"16","author":"G. Hedlund","year":"1967","unstructured":"Hedlund G., Remarks on the work of Axel Thue on sentences, Nord. Mat. Tidskr 16(1967), 148\u20131","journal-title":"Nord. Mat. Tidskr"},{"key":"2_CR26","first-page":"301","volume":"21","author":"S. Istrail","year":"1977","unstructured":"Istrail S., On irreductible languages and non rational numbers, Bull. Mat. Soc. Sci. Mat. R. S. Roumanie 21(1977), 301\u2013308.","journal-title":"Bull. Mat. Soc. Sci. Mat. R. S. Roumanie"},{"key":"2_CR27","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(83)90002-1","volume":"5","author":"J. Karhum\u00e4ki","year":"1983","unstructured":"Karhum\u00e4ki J., On cube-free \u03c9-words generated by binary morphisms, Discr. Appl. Math 5(1983), 279\u2013297.","journal-title":"Discr. Appl. Math"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Leconte M., A fine characterization of power-free morphisms, Techn. Report L.I.T.P. 1984.","DOI":"10.1016\/0304-3975(85)90213-0"},{"key":"2_CR29","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/sapm197655183","volume":"55","author":"S. Li","year":"1976","unstructured":"Li S., Annihilators in nonrepetitive semigroups, Studies in Appl. Math. 55(1976), 83\u201385.","journal-title":"Studies in Appl. Math."},{"key":"2_CR30","unstructured":"Lothaire M., \"Combinatorics on Words\", Addison-Wesley 1983."},{"key":"2_CR31","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0020-0190(82)90109-0","volume":"15","author":"M. Main","year":"1982","unstructured":"Main M., Permutations are not context-free: an application of the \u2018Interchange Lemma', Inf. Proc. Letters 15(1982), 68\u201371.","journal-title":"Inf. Proc. Letters"},{"key":"2_CR32","unstructured":"Main M., R. Lorentz, An O(n log n) algorithm for recognizing repetition, Washington State University, Techn. Report CS-79-056."},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Main M., R. Lorentz, An O(n log n) algorithm for finding all repetitions in a string, J. Algorithms, 1983, to appear.","DOI":"10.1016\/0196-6774(84)90021-X"},{"key":"2_CR34","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"E. McCreight","year":"1976","unstructured":"McCreight E., A space-economical suffix tree construction algorithm, J. Assoc. Mach. Comp. 23(1976), 262\u2013272.","journal-title":"J. Assoc. Mach. Comp."},{"key":"2_CR35","unstructured":"Minsky S., \"Computations: finite and infinite machines\", Prentice-Hall 1967."},{"key":"2_CR36","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1090\/S0002-9947-1921-1501161-8","volume":"22","author":"M. Morse","year":"1921","unstructured":"Morse M., Recurrent geodesics on a surface of negative curvature, Trans. Amer. Math. Soc. 22(1921), 84\u2013100.","journal-title":"Trans. Amer. Math. Soc."},{"key":"2_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1215\/S0012-7094-44-01101-4","volume":"11","author":"M. Morse","year":"1944","unstructured":"Morse M., G. Hedlund, Unending chess, symbolic dynamics and a problem in semigroups, Duke Math. J. 11(1944), 1\u20137.","journal-title":"Duke Math. J."},{"key":"2_CR38","unstructured":"Ogden W., R. Ross, K. Winklmann, An \"Interchange lemma\" for context-free languages, Washington State University, Techn. Report CS-81-080."},{"key":"2_CR39","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0020-0190(81)90004-1","volume":"12","author":"J. Pansiot","year":"1981","unstructured":"Pansiot J., The Morse sequence and iterated morphisms, Inf. Proc. Letters 12(1981), 68\u201370.","journal-title":"Inf. Proc. Letters"},{"key":"2_CR40","unstructured":"Pansiot J., A propos d'une conjecture de F. Dejean sur les r\u00e9p\u00e9titions dans les mots, Discrete Appl. Math."},{"key":"2_CR41","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1017\/S0305004100046077","volume":"68","author":"P. Pleasants","year":"1970","unstructured":"Pleasants P., Nonrepetitive sequences, Proc. Cambridge Phil. Soc. 68(1970), 267\u2013274.","journal-title":"Proc. Cambridge Phil. Soc."},{"key":"2_CR42","unstructured":"Restivo A., S. Salemi, On weakly square free words, Inf. Proc. Letters, to appear."},{"key":"2_CR43","first-page":"175","volume":"115","author":"C. Reutenauer","year":"1981","unstructured":"Reutenauer C., A new characterization of the regular languages, 8th ICALP, Springer Lecture Notes in Computer Science 115, 1981, 175\u2013183.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"2_CR44","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1051\/ita\/1982160301911","volume":"16","author":"R. Ross","year":"1982","unstructured":"Ross R., K. Winklmann, Repetitive strings are not context-free, RAIRO Informatique th\u00e9orique 16(1982), 191\u2013199.","journal-title":"RAIRO Informatique th\u00e9orique"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Salomaa A., Morphisms on free monoids and language theory, in: R. Book (ed.): \"Formal language theory: perspectives and open problems\", Academic Press 1098, 141\u2013166.","DOI":"10.1016\/B978-0-12-115350-2.50011-7"},{"key":"2_CR46","unstructured":"Salomaa A., \"Jewels of Formal Language Theory\", Pitman 1981."},{"key":"2_CR47","first-page":"439","volume":"295","author":"P. Seebold","year":"1982","unstructured":"Seebold P., Morphismes it\u00e9r\u00e9s, mot de Morse et mot de Fibonacci, C. R. Acad. Sci. Paris, 295(1982), 439\u2013441.","journal-title":"C. R. Acad. Sci. Paris"},{"key":"2_CR48","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BFb0036490","volume":"145","author":"P. Seebold","year":"1983","unstructured":"Seebold P. Sur les morohismes qui engendrent des mots infinis ayant des facteurs prescrits, 6. GI Tagung Theoretische Informatik, Lecture Notes Comp. Sci. 145, 1983, 301\u2013311.","journal-title":"Lecture Notes Comp. Sci."},{"key":"2_CR49","unstructured":"Seebold P., Sequences generated by infinitely iterated morphisms, Techn. Report Universite de Paris VII, L.I.T.P 83-13."},{"key":"2_CR50","first-page":"195","volume":"321","author":"R. Shelton","year":"1981","unstructured":"Shelton R., Aperiodic words on three symbols, I, II, J. reine angew. Math. 321(1981), 195\u2013209, 327(1981), 1\u201311.","journal-title":"J. reine angew. Math."},{"key":"2_CR51","first-page":"44","volume":"330","author":"R. Shelton","year":"1982","unstructured":"Shelton R., R. Soni, Aperiodic words on three symbols III, J. reine angew. Math., 330(1982), 44\u201352.","journal-title":"J. reine angew. Math."},{"key":"2_CR52","doi-asserted-by":"crossref","unstructured":"Shyr J., A strongly primitive word of arbitrary length and its applications, Int. J. Comp. Math A-6(19770, 165\u2013170.","DOI":"10.1080\/00207167708803136"},{"key":"2_CR53","first-page":"392","volume":"21","author":"A. Slisenko","year":"1980","unstructured":"Slisenko A., Determination in real time of all the periodicities in a word, Soviet Math. Dokl. 21(1980), 392\u2013395.","journal-title":"Soviet Math. Dokl."},{"key":"2_CR54","unstructured":"Thue A., Uber unendliche Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania (1906), 1\u201322."},{"key":"2_CR55","unstructured":"Thue A., Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania (1912), 1\u201367."},{"key":"2_CR56","doi-asserted-by":"crossref","unstructured":"Weiner P., Linear pattern matching algorithms, Proc. 14th Symp. switching automata theory, 1973, 1\u201311.","DOI":"10.1109\/SWAT.1973.13"}],"container-title":["Lecture Notes in Computer Science","STACS 84"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12920-0_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T01:27:41Z","timestamp":1640914061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12920-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540129202","9783540388050"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/3-540-12920-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}
