{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:10:40Z","timestamp":1777644640638,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.3233\/fi-2012-682","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T00:04:46Z","timestamp":1575331486000},"page":"251-263","source":"Crossref","is-referenced-by-count":0,"title":["Length-k-overlap-free Binary Infinite Words"],"prefix":"10.1177","volume":"116","author":[{"given":"Patrice","family":"S\u00e9\u00e9bold","sequence":"first","affiliation":[{"name":"Univ. Montpellier 3 Paul Val\u00e9ry, Montpellier, F-34199, France"},{"name":"LIRMM, CNRS, F-34392, France, Patrice.Seebold@lirmm.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-2012-682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:30:00Z","timestamp":1777444200000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/FI-2012-682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"references-count":0,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2012]]}},"URL":"https:\/\/doi.org\/10.3233\/fi-2012-682","relation":{},"ISSN":["0169-2968"],"issn-type":[{"value":"0169-2968","type":"print"}],"subject":[],"published":{"date-parts":[[2012]]}}}