{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:47Z","timestamp":1725490247979},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_29","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:32:38Z","timestamp":1188336758000},"page":"328-337","source":"Crossref","is-referenced-by-count":0,"title":["On the Computational Complexity of Infinite Words"],"prefix":"10.1007","author":[{"given":"Pavol","family":"\u010euri\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1n","family":"Ma\u0148uch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"29_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1007\/3-540-62844-4_26","volume-title":"New trends in formal languages","author":"J. Hromkovi\u010d","year":"1997","unstructured":"Hromkovi\u010d, J., Karhum\u00e4ki, J., Two lower bounds on computational complexity of infinite words, New trends in formal languages, LNCS 1218, 366\u2013376, 1997."},{"key":"29_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-58131-6_46","volume-title":"Results and trends in theoretical computer science","author":"J. Hromkovi\u010d","year":"1994","unstructured":"Hromkovi\u010d, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Comparing descriptional and computational complexity of infinite words, Results and trends in theoretical computer science, LNCS 812, 169\u2013182, 1994."},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1142\/S0129054194000050","volume":"5","author":"K. Culik II","year":"1994","unstructured":"Culik, K., II, Karhum\u00e4ki, J., Iterative devices generating infinite words, Int. J. Found. Comput. Sci., Vol. 5 No. 1, 69\u201397, 1994.","journal-title":"Int. J. Found. Comput. Sci."},{"key":"29_CR4","first-page":"350","volume-title":"Developments in Language Theory II","author":"A. Lepist\u00f6","year":"1996","unstructured":"Lepist\u00f6, A., On the computational complexity of infinite words, In: Developments in Language Theory II (eds.: J. Dassow, G. Rozenberg, A. Salomaa), World-Scientific, Singapore, 350\u2013359, 1996."},{"key":"29_CR5","first-page":"662","volume":"1","author":"A. N. Kolmogorov","year":"1968","unstructured":"Kolmogorov, A. N., Three approaches to the quantitative definition of information, Problems Inform. Transmission 1, 662\u2013664, 1968.","journal-title":"Problems Inform. Transmission"},{"key":"29_CR6","volume-title":"Combinatorics on words","author":"M. Lothaire","year":"1981","unstructured":"Lothaire, M., Combinatorics on words, Addison-Wesley, Reading, Massachusetts, 1981."},{"key":"29_CR7","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A., \u00dcber unendliche Zeichenreihen, Norske Vid. Selsk. Skr., I Mat. Nat. KI., Kristiania 7, 1\u201322, 1906.","journal-title":"Norske Vid. Selsk. Skr., I Mat. Nat. KI., Kristiania"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T01:34:37Z","timestamp":1550885677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}