{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T07:17:57Z","timestamp":1725952677115},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000778"],"id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1016\/j.tcs.2023.114341","type":"journal-article","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T22:21:27Z","timestamp":1702592487000},"page":"114341","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["String attractors of episturmian sequences"],"prefix":"10.1016","volume":"986","author":[{"ORCID":"http:\/\/orcid.org\/0000-0001-7208-4248","authenticated-orcid":false,"given":"L'ubom\u00edra","family":"Dvo\u0159\u00e1kov\u00e1","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2023.114341_br0010","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","article-title":"Episturmian words and some constructions of de Luca and Rauzy","volume":"255","author":"Droubay","year":"2001","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2023.114341_br0020","series-title":"Combinatorics on Words, WORDS 2023","first-page":"192","article-title":"String attractors of fixed points of k-bonacci-like morphisms","volume":"vol. 13899","author":"Gheeraert","year":"2023"},{"key":"10.1016\/j.tcs.2023.114341_br0030","series-title":"STOC 2018","first-page":"827","article-title":"At the roots of dictionary compression: string attractors","author":"Kempa","year":"2018"},{"key":"10.1016\/j.tcs.2023.114341_br0040","series-title":"LATIN","first-page":"207","article-title":"Towards a definitive measure of repetitiveness","volume":"vol. 12118","author":"Kociumaka","year":"2020"},{"key":"10.1016\/j.tcs.2023.114341_br0050","series-title":"SPIRE","first-page":"213","article-title":"On repetitiveness measures of Thue-Morse words","volume":"vol. 12303","author":"Kutsukake","year":"2020"},{"key":"10.1016\/j.tcs.2023.114341_br0060","series-title":"ICTCS","first-page":"57","article-title":"String attractors and combinatorics on words","volume":"vol. 2504","author":"Mantaci","year":"2019"},{"key":"10.1016\/j.tcs.2023.114341_br0070","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2020.11.006","article-title":"A combinatorial view on string attractors","volume":"850","author":"Mantaci","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.tcs.2023.114341_br0080","series-title":"LATIN","first-page":"426","article-title":"String attractors and infinite words","volume":"vol. 13568","author":"Restivo","year":"2022"},{"key":"10.1016\/j.tcs.2023.114341_br0090","author":"Schaeffer"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397523006540?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397523006540?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T04:47:01Z","timestamp":1705121221000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397523006540"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":9,"alternative-id":["S0304397523006540"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2023.114341","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"String attractors of episturmian sequences","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2023.114341","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"114341"}}
