{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:06:39Z","timestamp":1726412799548},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633570"},{"type":"electronic","value":"9783540695226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0045106","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T09:16:11Z","timestamp":1139217371000},"page":"393-402","source":"Crossref","is-referenced-by-count":0,"title":["A complete characterization of repetitive morphisms over the two-letter alphabet"],"prefix":"10.1007","author":[{"given":"Yuji","family":"Kobayashi","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]},{"given":"Patrice","family":"S\u00e9\u00e9bold","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(86)90034-7","volume":"22","author":"J. Berstel","year":"1986","unstructured":"J. Berstel. Every iterated morphism yields a co-CFL. Information Processing Letters, 22:7\u20139, 1986.","journal-title":"Information Processing Letters"},{"key":"41_CR2","doi-asserted-by":"crossref","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 DOL languages. Information and Control, 59:13\u201335, 1983.","journal-title":"Information and Control"},{"key":"41_CR3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0304-3975(84)90093-8","volume":"33","author":"T. Harju","year":"1984","unstructured":"T. Harju and M. Linna. The equations h(w) = w\nn in binary alphabets. Theoretical Computer Science, 33:327\u2013329, 1984.","journal-title":"Theoretical Computer Science"},{"key":"41_CR4","doi-asserted-by":"crossref","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 DOL languages. Theoretical Computer Science, 46:83\u201389, 1986.","journal-title":"Theoretical Computer Science"},{"key":"41_CR5","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":"41_CR6","series-title":"Mathematische Schriften Kassel","volume-title":"Repetitiveness of languages generated by morphisms","author":"Y. Kobayashi","year":"1997","unstructured":"Y. Kobayashi and F. Otto. Repetitiveness of languages generated by morphisms. Mathematische Schriften Kassel 2\/97, Universit\u00e4t-GH Kassel, February 1997."},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/3-540-56939-1_98","volume-title":"If a DOL language is k-power free then it is circular","author":"F. Mignosi","year":"1993","unstructured":"F. Mignosi and P. S\u00e9\u00e9bold. If a DOL 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":"41_CR8","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":"41_CR9","unstructured":"G. Rozenberg and A. Salomaa, editors. Lindenmayer Systems. Springer-Verlag. Berlin, 1992."},{"key":"41_CR10","first-page":"137","volume":"36","author":"P. S\u00e9\u00e9bold","year":"1988","unstructured":"P. S\u00e9\u00e9bold. An effective solution to the DOL periodicity problem in the binary case. Bulletin of the EATCS, 36:137\u2013151, 1988.","journal-title":"Bulletin of the EATCS"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0045106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T09:03:32Z","timestamp":1549703012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0045106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633570","9783540695226"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0045106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}