{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:14Z","timestamp":1725664334806},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581314"},{"type":"electronic","value":"9783540484455"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58131-6_46","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:17:09Z","timestamp":1330269429000},"page":"169-182","source":"Crossref","is-referenced-by-count":4,"title":["Comparing descriptional and computational complexity of infinite words"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Juhani","family":"Karhum\u00e4ki","sequence":"additional","affiliation":[]},{"given":"Arto","family":"Lepist\u00f6","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1007\/BF00289160","volume":"26","author":"J.M. Autebert","year":"1989","unstructured":"J.M. Autebert, J. Gabar\u00f3: Iterated GSM's and Co-CFL. Acta Informatica 26(1989), 749\u2013769.","journal-title":"Acta Informatica"},{"key":"14_CR2","unstructured":"K. Culik II and J. Karhum\u00e4ki: Iterative devices generating infinite words. IJFCS (to appear)."},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","volume":"16","author":"G.J. Chaitin","year":"1969","unstructured":"G.J. Chaitin: On the length of programs for computing finite binary sequences:statistical considerations. J. Assoc. Comp. Mach. 16(1969), 145\u2013159.","journal-title":"J. Assoc. Comp. Mach."},{"key":"14_CR4","unstructured":"J. Hromkovic and J. Karhum\u00e4ki: Two lower bounds on complexity of infinite word generation, manuscript (1993)."},{"key":"14_CR5","first-page":"662","volume":"1","author":"A.N. Kolmogorov","year":"1968","unstructured":"A.N. Kolmogorov: Three approaches to the quantitative definition of information. Problems Inform. Transmission 1(1968), 662\u2013664.","journal-title":"Problems Inform. Transmission"},{"key":"14_CR6","first-page":"187","volume-title":"Hand-book of Theoretical Computer Science A \u2014 Algorithms and Complexity","author":"M. Li","year":"1990","unstructured":"M. Li, P.M.B. Vit\u00e1nyi: Kolmogorov complexity and its applications. In: Hand-book of Theoretical Computer Science A \u2014 Algorithms and Complexity (Jan van Leeuwen, ed.), Elsevier, Amsterdam, New York-Oxford-Tokyo & The MIT Press, Cambridge 1990, 187\u2013254."},{"key":"14_CR7","volume-title":"Developments in Language Theory","author":"A. Lepist\u00f6","year":"1994","unstructured":"A. Lepist\u00f6: Repetitions in Kolakoski Sequence. In: Developments in Language Theory (G. Rozenberg and A. Salomaa, eds.), World Scientific, Singapore 1994."},{"key":"14_CR8","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1981","unstructured":"M. Lothaire: Combinatorics on Words. Addison-Wesley, Reading, Massachusetts 1981."},{"key":"14_CR9","volume-title":"Technical Report 93.40","author":"D. Perrin","year":"1993","unstructured":"D. Perrin and J.-E. Pin: Mots Infinis. Technical Report 93.40. LITP, Paris 1993."},{"key":"14_CR10","volume-title":"Jewels of formal language theory","author":"A. Salomaa","year":"1981","unstructured":"A. Salomaa: Jewels of formal language theory. Computer Science Press, Rockville, Maryland 1981."},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R.J. Solomonoff","year":"1964","unstructured":"R.J. Solomonoff: A formal theory of inductive inference. Part 1 and Part 2. Inform. and Control 7(1964), 1\u201322 and 224\u2013254.","journal-title":"Inform. and Control"},{"key":"14_CR12","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"A. Thue: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr., I Mat. Nat. KI., Kristiania 7(1906), 1\u201322.","journal-title":"Norske Vid. Selsk. Skr., I Mat. Nat. KI., Kristiania"}],"container-title":["Lecture Notes in Computer Science","Results and Trends in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58131-6_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:11:24Z","timestamp":1619572284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58131-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581314","9783540484455"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58131-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}