{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:19:23Z","timestamp":1758824363775},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2004,4]]},"abstract":"<jats:p> After giving an overview about morphisms and k-power-freeness (k\u2208 IN ), we present several conjectures, and partially solve one of those by giving, for any integer k\u22653, binary morphisms which are not k-power-free, but which are (k+1)-power-free and generate k-power-free infinite words. <\/jats:p>","DOI":"10.1142\/s0129054104002431","type":"journal-article","created":{"date-parts":[[2004,4,22]],"date-time":"2004-04-22T13:19:46Z","timestamp":1082639986000},"page":"307-316","source":"Crossref","is-referenced-by-count":7,"title":["CONJECTURES AND RESULTS ON MORPHISMS GENERATING k-POWER-FREE WORDS"],"prefix":"10.1142","volume":"15","author":[{"given":"GW\u00c9NA\u00cbL","family":"RICHOMME","sequence":"first","affiliation":[{"name":"LaRIA, Universit\u00e9 de Picardie Jules Verne,  33, rue Saint Leu, 80039 Amiens c\u00e9dex 01, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PATRICE","family":"S\u00c9\u00c9BOLD","sequence":"additional","affiliation":[{"name":"LaRIA, Universit\u00e9 de Picardie Jules Verne,  33, rue Saint Leu, 80039 Amiens c\u00e9dex 01, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1979.85.261"},{"key":"rf2","first-page":"178","volume":"79","author":"Berstel J.","journal-title":"Bull. EATCS"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(88)90009-6"},{"key":"rf6","first-page":"301","volume":"21","author":"Istrail S.","journal-title":"Bull. Mat. Soc. Sci. Mat. R.S. Roumanie"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(83)90002-1"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90213-0"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019"},{"key":"rf16","first-page":"225","volume":"33","author":"Prouhet M. E.","journal-title":"Comptes Rendus Acad. Sci. Paris"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00437-0"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2001104"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054104002431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:37:23Z","timestamp":1565138243000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054104002431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":10,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2004,4]]}},"alternative-id":["10.1142\/S0129054104002431"],"URL":"https:\/\/doi.org\/10.1142\/s0129054104002431","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}