{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:40Z","timestamp":1759638880942},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569398"},{"type":"electronic","value":"9783540478263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_98","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:56:26Z","timestamp":1330257386000},"page":"507-518","source":"Crossref","is-referenced-by-count":20,"title":["If a DOL language is k-power free then it is circular"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Mignosi","sequence":"first","affiliation":[]},{"given":"Patrice","family":"S\u00e9\u00e9bold","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-09510-1_2","volume":"71","author":"J. Berstel","year":"1979","unstructured":"J. Berstel, \u201cSur les mots sans carr\u00e9 d\u00e9finis par un morphisme\u201d, in Springer Lectures Notes in Computer Science Vol 71 (1979), 16\u201325.","journal-title":"Springer Lectures Notes in Computer Science"},{"key":"42_CR2","unstructured":"J. Berstel, \u201cSome recent results on square-free words\u201d (STACS 84) Tech. Rept. L.I.T.P. 84-6."},{"key":"42_CR3","unstructured":"J. Berstel, \u201cMotifs et r\u00e9p\u00e9titions\u201d, in Actes du Congres \u201cJourn\u00e9es Montoises\u201d, 1990, 9\u201315."},{"key":"42_CR4","unstructured":"J. Berstel and D. Perrin, \u201cTheory of Codes\u201d, 1985 Academic Press."},{"key":"42_CR5","first-page":"69","volume":"23","author":"F. J. Brandenburg","year":"1983","unstructured":"F. J. Brandenburg, \u201cUniformly growing kth power free homomorphisms\u201d, T.C.S. 23 (1983), 69\u201382.","journal-title":"T.C.S."},{"key":"42_CR6","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0020-0190(83)90094-7","volume":"16","author":"A. Carpi","year":"1983","unstructured":"A. Carpi,\u201cOn the size of a square-free morphism on a three letter alphabet\u201d, Inf. Proc. Lett. 16 (1983), 231\u2013235.","journal-title":"Inf. Proc. Lett."},{"key":"42_CR7","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1051\/ita\/1985190403371","volume":"19","author":"A. Cerny","year":"1985","unstructured":"A. Cerny,\u201cOn a class of infinite words with bounded repetitions\u201d, RAIRO Inf. Th. 19 (1985), 337\u2013349.","journal-title":"RAIRO Inf. Th."},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"C. Choffrut, \u201cIterated Substitutions and Locally Catenative Systems: a Decidability Result in the Binary Case\u201d, in Proc. ICALP 90,Lecture Notes in Comp. Science, Springer (1990), 490\u2013500.","DOI":"10.1007\/BFb0032053"},{"key":"42_CR9","first-page":"221","volume":"18","author":"M. Crochemore","year":"1982","unstructured":"M. Crochemore, \u201cSharp Characterizations of square free morphisms\u201d T. C. S. 18 (1982) 221\u2013226.","journal-title":"T. C. S."},{"key":"42_CR10","first-page":"25","volume":"16","author":"A. Ehrenfeucht","year":"1981","unstructured":"A. Ehrenfeucht and G. Rozenberg, \u201cOn the subword complexity of square-free DOL languages\u201d T.C.S. 16 (1981), 25\u201332.","journal-title":"T.C.S."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"A. Ehrenfeucht and G. Rozenberg, \u201cRepetitions in homomorphisms and Languages\u201d in 9th ICALP Symposium, Lecture Notes in Comp. Science, Springer (1982), 192\u2013196.","DOI":"10.1007\/BFb0012769"},{"key":"42_CR12","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, \u201cRepetitions of Subwords in DOL Languages\u201d, Information and Control 59 (1983), 13\u201335.","journal-title":"Information and Control"},{"key":"42_CR13","volume-title":"Introduction to Formal Language Theory","author":"M. Harrison","year":"1978","unstructured":"M. Harrison, \u201cIntroduction to Formal Language Theory\u201d Addison-Wesley, Readings, Mass., 1978."},{"issue":"n\u21341","key":"42_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ita\/1986200100471","volume":"20","author":"Harju","year":"1986","unstructured":"Harju and M. Linna,\u201cOn the periodicity of morphisms on free monoids\u201d, RAIRO Inf. Th. vol. 20 (1986), n\u21341, 47\u201354.","journal-title":"RAIRO Inf. Th."},{"key":"42_CR15","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1017\/S0143385700003679","volume":"6","author":"B. Host","year":"1986","unstructured":"B. Host, \u201cValeurs propres des syst\u00e8mes dynamiques d\u00e9finis par des substitutions de longueur variable\u201d Erg. Th. and Dyn. Sys. 6 (1986), 529\u2013540.","journal-title":"Erg. Th. and Dyn. Sys."},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"J. Karhum\u00e0ki, \u201cOn cube free w-words generated by binary morphisms\u201d, in Proc. FCT'81, Lecture Notes in Comp. Science 117, Springer (1981), 182\u2013189.","DOI":"10.1007\/3-540-10854-8_19"},{"key":"42_CR17","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(83)90002-1","volume":"5","author":"J. Karhum\u00e0ki","year":"1983","unstructured":"J. Karhum\u00e0ki, \u201cOn cube free w-words generated by binary morphisms\u201d, Discr. Appl. Math. 5 (1983), 279\u2013297.","journal-title":"Discr. Appl. Math."},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"V. Keranen, \u201cOn the k-freeness of morphisms on free monoids\u201d, STACS 87, Lecture Notes in Comp. Science 247, 180\u2013187.","DOI":"10.1007\/BFb0039605"},{"key":"42_CR19","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1051\/ita\/1988220201351","volume":"22","author":"R. Kfoury","year":"1988","unstructured":"R. Kfoury, \u201cA linear time algorithm to decide whether a binary word contains an overlap\u201d, RAIRO Inf. Th. 22 (1988), 135\u2013145.","journal-title":"RAIRO Inf. Th."},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"M. Leconte, \u201ckth power free codes\u201d in \u201cAutomata on infinite words\u201d, M. Nivat and D. Perrin editors, Lecture Notes in Comp. Science 192, Springer-Verlag, 1984,172\u2013187.","DOI":"10.1007\/3-540-15641-0_33"},{"issue":"1","key":"42_CR21","first-page":"117","volume":"38","author":"M. Leconte","year":"1985","unstructured":"M. Leconte,\u201cA Characterization of power-free morphisms\u201d, T.C.S. 38(1) (1985), 117\u2013122.","journal-title":"T.C.S."},{"key":"42_CR22","first-page":"128","volume-title":"Proc. University of North Carolina","author":"A. Lentin","year":"1967","unstructured":"A. Lentin and M. P. Schutzenberger, \u201cA combinatorial problem in the theory of free monoids\u201d, in Proc. University of North Carolina, (1967), Boss ed., North Carolina Press, Chapell Hill, 128\u2013144."},{"key":"42_CR23","volume-title":"Combinatorics on words","author":"Lothaire","year":"1982","unstructured":"Lothaire, \u201cCombinatorics on words\u201d, Addison Wesley, Reading Mass. 1982."},{"key":"42_CR24","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01824809","volume":"7","author":"J. C. Martin","year":"1973","unstructured":"J. C. Martin,\u201cMinimal flows arising from substitutions of non constant length\u201d Math. Sys. Th. 7 (1973), 73\u201382.","journal-title":"Math. Sys. Th."},{"key":"42_CR25","first-page":"221","volume":"65","author":"F. Mignosi","year":"1989","unstructured":"F. Mignosi, \u201cInfinite word with linear subword complexity\u201d, T.C.S. 65 (1989), 221\u2013242.","journal-title":"T.C.S."},{"issue":"n\u21343","key":"42_CR26","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1051\/ita\/1992260301991","volume":"26","author":"F. Mignosi","year":"1992","unstructured":"F. Mignosi, G. Pirillo, \u201cRepetitions in the Fibonacci infinite word\u201d, RAIRO Inf. Th. vol. 26, n\u2134 3 (1992), 199\u2013204.","journal-title":"RAIRO Inf. Th."},{"key":"42_CR27","doi-asserted-by":"crossref","unstructured":"B. Moss\u00e9, \u201cPulssance de mots et reconnaissabilit\u00e9 des points fixes d'une substitution\u201d T.C.S. (1992)","DOI":"10.1016\/0304-3975(92)90357-L"},{"key":"42_CR28","doi-asserted-by":"crossref","unstructured":"M. Queffeleq,\u201cSubstitution dynamical systems \u2014 Spectral analysis\u201d Lecture Notes in Math. 1294 (1987), Springer-Verlag.","DOI":"10.1007\/BFb0081890"},{"key":"42_CR29","doi-asserted-by":"crossref","unstructured":"A. Restivo and S. Salemi, \u201cOverlap free words on two symbols\u201d, in \u201cAutomata on infinite words\u201d, M. Nivat and D. Perrin editors, Lecture Notes in Comp.Science 192, Springer-Verlag, 1984,198\u2013206.","DOI":"10.1007\/3-540-15641-0_35"},{"key":"42_CR30","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0166-218X(85)90077-0","volume":"11","author":"P. S\u00e9\u00e9bold","year":"1985","unstructured":"P. S\u00e9\u00e9bold, \u201cSequences generated by infinitely iterated morphisms\u201d, Discr. Appl. Math. 11 (1985), 255\u2013264.","journal-title":"Discr. Appl. Math."},{"key":"42_CR31","first-page":"137","volume":"36","author":"P. S\u00e9\u00e9bold","year":"1988","unstructured":"P. S\u00e9\u00e9bold, \u201cAn effective solution to the DOL-periodicity problem in the binary case\u201d, EATCS bull. 36 (1988), 137\u2013151.","journal-title":"EATCS bull."},{"key":"42_CR32","unstructured":"G. Rozenberg and A. Salomaa, \u201cThe mathematical theory of L Systems\u201d, Academic Press, 1980."},{"key":"42_CR33","doi-asserted-by":"crossref","unstructured":"G. Rozenberg and A. Salomaa editors, \u201cThe book of L\u201d, Springer-Verlag, 1986.","DOI":"10.1007\/978-3-642-95486-3"},{"key":"42_CR34","volume-title":"Jewels of Formal Language Theory","author":"A. Salomaa","year":"1981","unstructured":"A. Salomaa, \u201cJewels of Formal Language Theory\u201d, Computer Science Press, Washington, D. C., 1981."},{"key":"42_CR35","first-page":"1","volume":"Nr. 7","author":"A. Thue","year":"1906","unstructured":"Thue A., \u201c\u00fcber unendliche Zeichenreihen\u201d, Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl, Christiana 1906, Nr. 7, 1\u201322.","journal-title":"Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl, Christiana"},{"key":"42_CR36","first-page":"1","volume":"Nr. 1","author":"A. Thue","year":"1912","unstructured":"Thue A., \u201c\u00fcber die gegenseitige Lege gleicher Teile gewisser Zeichenrein\u201d, Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl., Christiana 1912, Nr. 1, 1\u201367.","journal-title":"Norske Vid. Selsk. Skr. I. Mat.-Nat. Kl., Christiana"}],"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-56939-1_98.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:07:35Z","timestamp":1605647255000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_98"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_98","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}