{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T14:40:58Z","timestamp":1648564858402},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3819,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0304-3975(02)00400-0","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T19:20:13Z","timestamp":1046460013000},"page":"141-151","source":"Crossref","is-referenced-by-count":0,"title":["On the computational complexity of infinite words"],"prefix":"10.1016","volume":"295","author":[{"given":"Pavol","family":"\u010euri\u0161","sequence":"first","affiliation":[]},{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(02)00400-0_BIB1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1142\/S0129054194000050","article-title":"Iterative devices generating infinite words","volume":"5","author":"Culik II","year":"1994","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00400-0_BIB2","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, J. Karhum\u00e4ki, Two lower bounds on computational complexity of infinite words, in: G. Paun, A. Salomaa (Eds.), New Trends in Formal Languages, Lecture Notes in Computer Science, Vol. 1218, 1997, pp. 366\u2013376.","DOI":"10.1007\/3-540-62844-4_26"},{"key":"10.1016\/S0304-3975(02)00400-0_BIB3","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d, J. Karhum\u00e4ki, A. Lepist\u00f6, Comparing descriptional and computational complexity of infinite words, in: J. Karhum\u00e4ki, H.A. Maurer, G. Rozenberg (Eds.), Results and Trends in Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 812, 1994, pp. 169\u2013182.","DOI":"10.1007\/3-540-58131-6_46"},{"key":"10.1016\/S0304-3975(02)00400-0_BIB4","first-page":"662","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1968","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0304-3975(02)00400-0_BIB5","series-title":"Developments in Language Theory II","first-page":"350","article-title":"On the computational complexity of infinite words","author":"Lepist\u00f6","year":"1996"},{"key":"10.1016\/S0304-3975(02)00400-0_BIB6","article-title":"Combinatorics on words","volume":"Vol. 17","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0304-3975(02)00400-0_BIB7","first-page":"1","article-title":"\u00dcber unendliche zeichenreihen","volume":"7","author":"Thue","year":"1906","journal-title":"Norske Vid. Selsk. Skr., I Mat. Nat. KI., Kristiania"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004000?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004000?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T07:28:44Z","timestamp":1553671724000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004000"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0304397502004000"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00400-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}