{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:22:31Z","timestamp":1743042151427,"version":"3.40.3"},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126906"},{"type":"electronic","value":"9783319126913"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12691-3_49","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T21:11:32Z","timestamp":1415999492000},"page":"652-665","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics"],"prefix":"10.1007","author":[{"given":"Bj\u00f8rn","family":"Kjos-Hanssen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"49_CR1","unstructured":"Alikhani, M.: American option pricing and optimal stopping for success runs. Master\u2019s thesis, University of Hawaii at Manoa, USA (2013)"},{"key":"49_CR2","unstructured":"Kjos-Hanssen, B.: Structure function for run complexity (2014). http:\/\/kjos-hanssen.appspot.com\/structure-function"},{"key":"49_CR3","unstructured":"Hyde, K.: Nondeterministic finite state complexity. Master\u2019s thesis, University of Hawaii at Manoa, USA (2013)"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-08783-2_6","volume-title":"Computing and Combinatorics","author":"KK Hyde","year":"2014","unstructured":"Hyde, K.K., Kjos-Hanssen, B.: Nondeterministic automatic complexity of almost square-free and strongly cube-free words. In: Cai, Z., Zelikovsky, A., Bourgeois, A. (eds.) COCOON 2014. LNCS, vol. 8591, pp. 61\u201370. Springer, Heidelberg (2014)"},{"issue":"3","key":"49_CR5","doi-asserted-by":"publisher","first-page":"196","DOI":"10.2307\/2686886","volume":"21","author":"MF Schilling","year":"1990","unstructured":"Schilling, M.F.: The longest run of heads. Coll. Math. J. 21(3), 196\u2013207 (1990)","journal-title":"Coll. Math. J."},{"key":"49_CR6","unstructured":"Shallit, J., Wang, M.-W.: Automatic complexity of strings. J. Autom. Lang. Comb. 6(4), 537\u2013554 (2001). 2nd Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, ON) (2000)"},{"issue":"2\u20133","key":"49_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.tcs.2007.04.013","volume":"383","author":"L Staiger","year":"2007","unstructured":"Staiger, L.: The Kolmogorov complexity of infinite words. Theor. Comput. Sci. 383(2\u20133), 187\u2013199 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"49_CR8","doi-asserted-by":"publisher","first-page":"3265","DOI":"10.1109\/TIT.2004.838346","volume":"50","author":"KN Vereshchagin","year":"2004","unstructured":"Vereshchagin, K.N., Vit\u00e1nyi, P.M.B.: Kolmogorov\u2019s structure functions and model selection. IEEE Trans. Inform. Theory 50(12), 3265\u20133290 (2004)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12691-3_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T03:38:21Z","timestamp":1676000301000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12691-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319126906","9783319126913"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12691-3_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}