{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:03:57Z","timestamp":1773252237877,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540133452","type":"print"},{"value":"9783540388869","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_34","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:03:13Z","timestamp":1330192993000},"page":"380-389","source":"Crossref","is-referenced-by-count":46,"title":["Complexit\u00e9 des facteurs des mots infinis engendr\u00e9s par morphismes it\u00e9r\u00e9s"],"prefix":"10.1007","author":[{"given":"Jean-Jacques","family":"Pansiot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"34_CR1","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.), Lee (K.P.) and Rozenberg (G.). \u2014 Subword complexities of various classes of deterministic developmental languages without interaction, Theoretical Computer Science, t. 1, 1975, p. 59\u201375.","journal-title":"Theoretical Computer Science"},{"key":"34_CR2","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.) and Rozenberg (G.). \u2014 On the subword complexity of square-free D0L-languages, Theoretical Computer Science, t. 16, 1981, p. 25\u201332.","journal-title":"Theoretical Computer Science"},{"key":"34_CR3","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(81)90121-6","volume":"13","author":"(A. ). Ehrenfeucht","year":"1981","unstructured":"Ehrenfeucht (A.) and Rozenberg (G.). \u2014 On the subword complexity of D0L-languages with a constant distribution, Information Processing Letters, t. 13, 1981, p. 108\u2013113.","journal-title":"Information Processing Letters"},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1051\/ita\/1982160403031","volume":"16","author":"(A. ). Ehrenfeucht","year":"1982","unstructured":"Ehrenfeucht (A.) and Rozenberg (G.). \u2014 On subword complexities of homomorphic images of languages, R.A.I.R.O. Informatique Th\u00e9orique, t. 16, 1982, p. 303\u2013316.","journal-title":"R.A.I.R.O. Informatique Th\u00e9orique"},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(83)90003-0","volume":"16","author":"(A. ). Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht (A.) and Rozenberg (G.). \u2014 On the subword complexity of locally catenative D0L-languages, Information Processing Letters, t. 16, 1983, p. 7\u20139.","journal-title":"Information Processing Letters"},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(83)90050-9","volume":"17","author":"(A. ). Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht (A.) and Rozenberg (G.). \u2014 On the subword complexity of m-free D0L-languages, Information Processing Letters, t. 17, 1983, p. 121\u2013124.","journal-title":"Information Processing Letters"},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00289415","volume":"20","author":"(J.-J. ) ). Pansiot","year":"1983","unstructured":"Pansiot (J.-J.). \u2014 Hi\u00e9rarchie et fermeture de certaines classes de tag-syst\u00e8mes, Acta Informatica, t. 20, 1983, p. 179\u2013196.","journal-title":"Acta Informatica"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Rozenberg (G.). \u2014 On the subword complexity of formal languages, Fundamentals of Computation Theory [Proc. FCT Conf., Szeged, Hungary. 1981], p. 328\u2013333. \u2014 Berlin, Springer-Verlag (Lecture Notes in Computer Science, 117, 1981).","DOI":"10.1007\/3-540-10854-8_36"},{"key":"34_CR9","volume-title":"The Mathematical Theory of L-systems","author":"(G. ). Rozenberg","year":"1980","unstructured":"Rozenberg (G.) and Salomaa (A.). \u2014 The Mathematical Theory of L-systems. \u2014 New York, Academic Press, 1980."},{"key":"34_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata Theoretic Aspects of Formal Power Series","author":"(A. ). Salomaa","year":"1978","unstructured":"Salomaa (A.) and Soittola (M.). \u2014 Automata Theoretic Aspects of Formal Power Series. \u2014 New York, Springer-Verlag, 1978."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:16Z","timestamp":1605643636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984]]}}}