{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:28:54Z","timestamp":1725456534249},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540115762"},{"type":"electronic","value":"9783540393085"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/bfb0012769","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T13:00:52Z","timestamp":1132750852000},"page":"192-196","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Repetitions in homomorphisms and languages"],"prefix":"10.1007","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,22]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-09510-1_2","volume":"71","author":"J. Berstel","year":"1979","unstructured":"J. Berstel, Sur les mots sans carr\u00e9 d\u00e9finis par un morphisme, 1979, Springer Lecture Notes in Computer Science, v71, 16\u201325.","journal-title":"Springer Lecture Notes in Computer Science"},{"issue":"no.2","key":"18_CR2","doi-asserted-by":"publisher","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","volume":"85","author":"D.R. Bean","year":"1979","unstructured":"D.R. Bean, A. Ehrenfeucht and G.F. Mc Nulty, Avoidable patterns in strings of symbols, 1979, Pacific Journal of Mathematics, v85, no.2, 261\u2013293.","journal-title":"Pacific Journal of Mathematics"},{"issue":"n.2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A. Cobham","year":"1972","unstructured":"A. Cobham, Uniform tag sequences, Mathematical Systems Theory, 1972, v.6, n.2, 164\u2013191.","journal-title":"Mathematical Systems Theory"},{"key":"18_CR4","volume-title":"Ph.D. Thesis","author":"F.M. Dekking","year":"1980","unstructured":"F.M. Dekking, Combinatorial and statistical properties of sequences generated by substitutions, 1980, Ph.D. Thesis, University of Nijmegen, Holland."},{"key":"18_CR5","volume-title":"Introduction to formal language theory","author":"M. Harrison","year":"1978","unstructured":"M. Harrison, Introduction to formal language theory, 1978, Addison-Wesley, Reading, Massachussetts."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"J. Karhumaki, On cubic-free \u03a9-words generated by binary morphisms, 1981 to appear.","DOI":"10.1007\/3-540-10854-8_19"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1215\/S0012-7094-44-01101-4","volume":"11","author":"M. Morse","year":"1944","unstructured":"M. Morse and G. Hedlund, Unending chess, symbolic dynamics and a problem of semigroups, 1944, Duke Math. Journal, v.11, 1\u20137.","journal-title":"Duke Math. Journal"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1017\/S0305004100046077","volume":"68","author":"P.A. Pleasants","year":"1970","unstructured":"P.A. Pleasants, Non-repetitive sequences, 1970, Proc. Cambridge Phil. Society, v.68, 267\u2013274.","journal-title":"Proc. Cambridge Phil. Society"},{"key":"18_CR9","volume-title":"The mathematical theory of L systems","author":"G. Rozenberg","year":"1980","unstructured":"G. Rozenberg and A. Salomaa, The mathematical theory of L systems, 1980, Academic Press, London, New York."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/B978-0-12-115350-2.50011-7","volume-title":"Formal language theory, perspectives and open problems","author":"A. Salomaa","year":"1980","unstructured":"A. Salomaa, Morphisms on free monoids and language theory, in R.V. Book, ed., Formal language theory, perspectives and open problems, 1980, Academic Press, London, New York, 141\u2013166."},{"key":"18_CR11","unstructured":"A. Salomaa, Jewels of formal language theory, Computer Science Press, 1981."},{"key":"18_CR12","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"A. Thue, Uber unendliche Zeichenreihen, 1906, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Christiania, v.7, 1\u201322.","journal-title":"Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Christiania"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:56:49Z","timestamp":1558270609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540115762","9783540393085"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0012769","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1982]]},"assertion":[{"value":"22 October 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}