{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:38Z","timestamp":1725456338989},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029977","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"337-346","source":"Crossref","is-referenced-by-count":0,"title":["Repetitiveness of D0L-languages is decidable in polynomial time"],"prefix":"10.1007","author":[{"given":"Yuji","family":"Kobayash","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/S0019-9958(78)90095-5","volume":"38","author":"A. Ehrenfeucht","year":"1978","unstructured":"A. Ehrenfeucht and G. Rozenberg. Simplifications of homomorphisms. Information and Control, 38:298\u2013309, 1978.","journal-title":"Information and Control"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0304-3975(81)90028-1","volume":"16","author":"A. Ehrenfeucht","year":"1981","unstructured":"A. Ehrenfeucht and G. Rozenberg. On the subword complexity of square-free D0L languages. Theoretical Computer Science, 16:25\u201332, 1981.","journal-title":"Theoretical Computer Science"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0019-9958(83)80028-X","volume":"59","author":"A. Ehrenfeucht","year":"1983","unstructured":"A. Ehrenfeucht and G. Rozenberg. Repetition of subwords in D0L languages. Information and Control, 59:13\u201335, 1983.","journal-title":"Information and Control"},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ita\/1986200100471","volume":"20","author":"T. Harju","year":"1986","unstructured":"T. Harju and M. Linna. On the periodicity of morphisms on free monoids. RAIRO Informatique Th\u00e9orique et Applications, 20:47\u201354, 1986.","journal-title":"RAIRO Informatique Th\u00e9orique et Applications"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(86)90023-X","volume":"46","author":"T. Head","year":"1986","unstructured":"T. Head and B. Lando. Periodic D0L languages. Theoretical Computer Science, 46:83\u201389, 1986.","journal-title":"Theoretical Computer Science"},{"key":"34_CR6","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A., 1979."},{"key":"34_CR7","unstructured":"Y. Kobayashi and F. Otto. Repetitiveness of languages generated by morphisms. Preprint No. 2\/97, Fachbereich 17, Universit\u00e4t Kassel, 1997."},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of COCOON'97","author":"Y. Kobayashi","year":"1997","unstructured":"Y. Kobayashi, F. Otto, and P. Seebold. A complete characterization of repetitive morphisms over the two-letter alphabet. Proceedings of COCOON'97, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1997, to appear."},{"key":"34_CR9","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1982","unstructured":"M. Lothaire. Combinatorics on Words. Addison-Wesley, Mass., 1982."},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/3-540-56939-1_98","volume-title":"Automata, Languages and Programming, Proceedings of ICALP'93","author":"F. Mignosi","year":"1993","unstructured":"F. Mignosi and P. Seebold. If a D0L language is k-power free then it is circular. In Automata, Languages and Programming, Proceedings of ICALP'93, Lecture Notes in Computer Science 700, pages 507\u2013518. Springer-Verlag, Berlin, 1993."},{"key":"34_CR11","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. Academic Press, New York, 1980."},{"volume-title":"Lindenmayer Systems","year":"1992","key":"34_CR12","unstructured":"G. Rozenberg and A. Salomaa, editors. Lindenmayer Systems. Springer-Verlag, Berlin, 1992."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T06:04:51Z","timestamp":1549433091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029977"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0029977","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}