{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:22:44Z","timestamp":1743132164936,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_2","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"15-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Conditional Automatic Complexity and\u00a0Its Metrics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6199-1755","authenticated-orcid":false,"given":"Bj\u00f8rn","family":"Kjos-Hanssen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1109\/18.945257","volume":"47","author":"P G\u00e1cs","year":"2001","unstructured":"G\u00e1cs, P., Tromp, J.T., Vit\u00e1nyi, P.M.B.: Algorithmic statistics. IEEE Trans. Inform. Theory 47(6), 2443\u20132463 (2001). https:\/\/doi.org\/10.1109\/18.945257","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2_CR2","first-page":"1265","volume":"218","author":"P Ga\u010d","year":"1974","unstructured":"Ga\u010d, P.: The symmetry of algorithmic information. Dokl. Akad. Nauk SSSR 218, 1265\u20131267 (1974)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0019-9958(73)90554-8","volume":"22","author":"Y Horibe","year":"1973","unstructured":"Horibe, Y.: A note on entropy metrics. Inf. Control 22, 403\u2013404 (1973)","journal-title":"Inf. Control"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Hyde, K.K., Kjos-Hanssen, B.: Nondeterministic automatic complexity of overlap-free and almost square-free words. Electron. J. Combin. 22(3), 18 (2015)","DOI":"10.37236\/4851"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Kjos-Hanssen, B.: Automatic complexity of shift register sequences. Discrete Math. 341(9), 2409\u20132417 (2018). https:\/\/doi.org\/10.1016\/j.disc.2018.05.015","DOI":"10.1016\/j.disc.2018.05.015"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Kjos-Hanssen, B.: Few paths, fewer words: model selection with automatic structure functions. Exp. Math. 28(1), 121\u2013127 (2019). https:\/\/doi.org\/10.1080\/10586458.2017.1368048","DOI":"10.1080\/10586458.2017.1368048"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Kjos-Hanssen, B.: An incompressibility theorem for automatic complexity. Forum Math. Sigma 9, e62 (2021). https:\/\/doi.org\/10.1017\/fms.2021.58","DOI":"10.1017\/fms.2021.58"},{"key":"2_CR8","doi-asserted-by":"publisher","unstructured":"Kjos-Hanssen, B.: Interpolating between the Jaccard distance and an analogue of the normalized information distance. J. Logic Comput. 32(8), 1611\u20131623 (2022). https:\/\/doi.org\/10.1093\/logcom\/exac069. https:\/\/doi-org.eres.library.manoa.hawaii.edu\/10.1093\/logcom\/exac069","DOI":"10.1093\/logcom\/exac069"},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Li, M., Chen, X., Li, X., Ma, B., Vit\u00e1nyi, P.M.B.: The similarity metric. IEEE Trans. Inform. Theory 50(12), 3250\u20133264 (2004). https:\/\/doi.org\/10.1109\/TIT.2004.838101","DOI":"10.1109\/TIT.2004.838101"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"RC Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation $$a^{M}=b^{N}c^{P}$$ in a free group. Michigan Math. J. 9, 289\u2013298 (1962)","journal-title":"Michigan Math. J."},{"key":"2_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808876","volume-title":"A Second Course in Formal Languages and Automata Theory","author":"J Shallit","year":"2008","unstructured":"Shallit, J.: A Second Course in Formal Languages and Automata Theory, 1st edn. Cambridge University Press, New York, NY, USA (2008)","edition":"1"},{"key":"2_CR12","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":"1","key":"2_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/TIT.1953.1188572","volume":"1","author":"C Shannon","year":"1953","unstructured":"Shannon, C.: The lattice theory of information. Trans. IRE Prof. Group Inf. Theory 1(1), 105\u2013107 (1953). https:\/\/doi.org\/10.1109\/TIT.1953.1188572","journal-title":"Trans. IRE Prof. Group Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:08:41Z","timestamp":1702026521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}