{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:16:26Z","timestamp":1743023786343,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030615871"},{"type":"electronic","value":"9783030615888"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61588-8_9","type":"book-chapter","created":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T23:04:36Z","timestamp":1603235076000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Four Heads are Better than Three"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2059-194X","authenticated-orcid":false,"given":"Ville","family":"Salo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,21]]},"reference":[{"issue":"5","key":"9_CR1","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1070\/RM2010v065n05ABEH004702","volume":"65","author":"SI Adian","year":"2011","unstructured":"Adian, S.I.: The Burnside problem and related topics. Russ. Math. Surv. 65(5), 805\u2013855 (2011)","journal-title":"Russ. Math. Surv."},{"issue":"Supplement C","key":"9_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.tcs.2016.11.033","volume":"661","author":"N Aubrun","year":"2017","unstructured":"Aubrun, N., Barbieri, S., Sablik, M.: A notion of effectiveness for subshifts on finitely generated groups. Theoret. Comput. Sci. 661(Supplement C), 35\u201355 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-39300-1_5","volume-title":"Cellular Automata and Discrete Complex Systems","author":"S Barbieri","year":"2016","unstructured":"Barbieri, S., Kari, J., Salo, V.: The group of reversible turing machines. In: Cook, M., Neary, T. (eds.) AUTOMATA 2016. LNCS, vol. 9664, pp. 49\u201362. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39300-1_5"},{"key":"9_CR4","unstructured":"Bartholdi, L., Silva, P.V.: Groups defined by automata. arXiv preprint arXiv:1012.1531 (2010)"},{"key":"9_CR5","volume-title":"Topics in Geometric Group Theory","author":"P de La Harpe","year":"2000","unstructured":"de La Harpe, P.: Topics in Geometric Group Theory. University of Chicago Press, Chicago (2000)"},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1070\/SM2014v205n06ABEH004400","volume":"205","author":"RI Grigorchuk","year":"2014","unstructured":"Grigorchuk, R.I., Medynets, K.: On algebraic properties of topological full groups. Sb. Math. 205(6), 843\u2013861 (2014)","journal-title":"Sb. Math."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Guillon, P., Jeandel, E., Kari, J., Vanier, P.: Undecidable word problem in subshift automorphism groups. CoRR, abs\/1808.09194 (2018)","DOI":"10.1007\/978-3-030-19955-5_16"},{"issue":"01n02","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218196794000026","volume":"4","author":"SV Ivanov","year":"1994","unstructured":"Ivanov, S.V.: The free Burnside groups of sufficiently large exponents. Int. J. Algebra Comput. 4(01n02), 1\u2013308 (1994)","journal-title":"Int. J. Algebra Comput."},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Juschenko, K., Monod, N.: Cantor systems, piecewise translations and simple amenable groups. arXiv e-prints (2012)","DOI":"10.4007\/annals.2013.178.2.7"},{"issue":"02","key":"9_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1142\/S0129167X06003448","volume":"17","author":"H Matui","year":"2006","unstructured":"Matui, H.: Some remarks on topological full groups of cantor minimal systems. Int. J. Math. 17(02), 231\u2013251 (2006)","journal-title":"Int. J. Math."},{"issue":"11","key":"9_CR11","doi-asserted-by":"publisher","first-page":"2789","DOI":"10.1016\/j.jpaa.2011.03.019","volume":"215","author":"A Myasnikov","year":"2011","unstructured":"Myasnikov, A., Osin, D.: Algorithmically finite groups. J. Pure Appl. Algebra 215(11), 2789\u20132796 (2011)","journal-title":"J. Pure Appl. Algebra"},{"key":"9_CR12","unstructured":"Salo, V.: Impredictable subsets of $$\\mathbb{N}$$. MathOverflow (version: 2020-3-11). https:\/\/mathoverflow.net\/questions\/354526\/"},{"key":"9_CR13","unstructured":"Salo, V., Schraudner, M.: Automorphism groups of subshifts through group extensions. Preprint"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-18812-6_11","volume-title":"Cellular Automata and Discrete Complex Systems","author":"V Salo","year":"2015","unstructured":"Salo, V., T\u00f6rm\u00e4, I.: Plane-walking automata. In: Isokawa, T., Imai, K., Matsui, N., Peper, F., Umeo, H. (eds.) AUTOMATA 2014. LNCS, vol. 8996, pp. 135\u2013148. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18812-6_11"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s11047-017-9613-6","volume":"16","author":"V Salo","year":"2017","unstructured":"Salo, V., T\u00f6rm\u00e4, I.: Independent finite automata on Cayley graphs. Nat. Comput. 16(3), 411\u2013426 (2017). https:\/\/doi.org\/10.1007\/s11047-017-9613-6","journal-title":"Nat. Comput."},{"issue":"4","key":"9_CR16","first-page":"568","volume":"182","author":"EI Zel\u2019manov","year":"1991","unstructured":"Zel\u2019manov, E.I.: A solution of the restricted Burnside problem for 2-groups. Matematicheskii Sb. 182(4), 568\u2013592 (1991)","journal-title":"Matematicheskii Sb."},{"issue":"1","key":"9_CR17","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1070\/IM1991v036n01ABEH001946","volume":"36","author":"EI Zel\u2019manov","year":"1991","unstructured":"Zel\u2019manov, E.I.: Solution of the restricted Burnside problem for groups of odd exponent. Math. USSR Izv. 36(1), 41 (1991)","journal-title":"Math. USSR Izv."}],"container-title":["Lecture Notes in Computer Science","Cellular Automata and Discrete Complex Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61588-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T23:03:08Z","timestamp":1729465388000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-61588-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030615871","9783030615888"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61588-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AUTOMATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Cellular Automata and Discrete Complex Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Stockholm","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"automata2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/automata2020.weebly.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21","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":"11","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":"52% - 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-4","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":"2-3","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)"}},{"value":"The workshop was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}