{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:29Z","timestamp":1725455849633},"publisher-location":"Berlin\/Heidelberg","reference-count":7,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017289","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T02:22:34Z","timestamp":1132626154000},"page":"1-4","source":"Crossref","is-referenced-by-count":3,"title":["On the subword complexity and square-freeness of formal languages"],"prefix":"10.1007","author":[{"given":"A.","family":"Ehrenfeucht","sequence":"first","affiliation":[]},{"given":"G.","family":"Rozenberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1051\/ita\/1979130403631","volume":"13","author":"J.M. Autebert","year":"1979","unstructured":"Autebert, J.M., Beauquier, J., Boasson, L. and Nivat, M., Quelques problemes ouverts en th\u00e9orie des languages alg\u00e9braiques, RAIRO Informatique Theorique, v. 13, 363\u2013379, 1979.","journal-title":"RAIRO Informatique Theorique"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-09510-1_2","volume":"71","author":"J. Berstel","year":"1979","unstructured":"Berstel, J., Sur les mots sans carr\u00e9 d\u00e9finis par un morphisme, Lecture Notes in Computer Science, Springer-Verlag, v. 71, 16\u201325, 1979.","journal-title":"Lecture Notes in Computer Science, Springer-Verlag"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(75)90012-2","volume":"1","author":"A. Ehrenfeucht","year":"1975","unstructured":"Ehrenfeucht, A., Lee, K.P. and Rozenberg, G., Subword complexities of various classes of deterministic developmental languages without interactions, Theoretical Computer Science, v. 1, 59\u201376, 1975.","journal-title":"Theoretical Computer Science"},{"key":"1_CR4","unstructured":"Harrison, M., Introduction to formal language theory, Addison-Wesley, 1979."},{"key":"1_CR5","unstructured":"Rozenberg, G. and Salomaa, A., The mathematical theory of L-systems, Academic Press, 1979."},{"key":"1_CR6","unstructured":"Salomaa, A., Jewels of formal language theory, Computer Science Press, to appear."},{"key":"1_CR7","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A., Ueber unendliche Zeichenreihen, Norsk. Vid. Solsk. Skr. I Mat. Nat. Kl., nr. 7, 1\u201322, 1906.","journal-title":"Norsk. Vid. Solsk. Skr. I Mat. Nat. Kl."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017289.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:38:03Z","timestamp":1607531883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0017289","relation":{},"subject":[]}}