{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:00:36Z","timestamp":1743102036441,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343254"},{"type":"electronic","value":"9783031343261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34326-1_7","type":"book-chapter","created":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:04:23Z","timestamp":1687604663000},"page":"94-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Word Problem for\u00a0Finitary Automaton Groups"],"prefix":"10.1007","author":[{"given":"Maximilian","family":"Kotowsky","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7801-6569","authenticated-orcid":false,"given":"Jan Philipp","family":"W\u00e4chter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,24]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"DA Mix Barrington","year":"1989","unstructured":"Mix Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in $${NC}^1$$. J. Comput. Syst. Sci. 38(1), 150\u2013164 (1989)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Bartholdi, L., Figelius, M., Lohrey, M., Wei\u00df, A.: Groups with ALogTime-hard word problems and PSpace-complete circuit value problems. In: Saraf, S. (ed.) 35th Computational Complexity Conference (CCC 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 169, pp. 29:1\u201329:29. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020)","key":"7_CR2"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"705","DOI":"10.4171\/GGD\/560","volume":"14","author":"L Bartholdi","year":"2020","unstructured":"Bartholdi, L., Mitrofanov, I.: The word and order problems for self-similar and automata groups. Groups Geom. Dyn. 14, 705\u2013728 (2020)","journal-title":"Groups Geom. Dyn."},{"doi-asserted-by":"crossref","unstructured":"Bartholdi, L., Silva, P.: Groups defined by automata. In: Pin, J.E. (ed.) Handbook of Automata Theory, vol. II, chap. 24, pp. 871\u2013911. European Mathematical Society (2021)","key":"7_CR4","DOI":"10.4171\/automata-2\/2"},{"doi-asserted-by":"crossref","unstructured":"Bassino, F., et al.:Complexity and Randomness in Group Theory. De Gruyter (2020)","key":"7_CR5","DOI":"10.1515\/9783110667028"},{"doi-asserted-by":"crossref","unstructured":"Bishop, A., Elder, M.: Bounded automata groups are co-ET0L. In: Mart\u00edn-Vide, C., Okhotin, A., Shapira, D. (eds.) Language and Automata Theory and Applications, pp. 82\u201394. Springer International Publishing (2019)","key":"7_CR6","DOI":"10.1007\/978-3-030-13435-8_6"},{"doi-asserted-by":"crossref","unstructured":"Bondarenko, I., W\u00e4chter, J.Ph.: On orbits and the finiteness of bounded automaton groups. Internat. J. Algebra Comput. 31(06), 1177\u20131190 (2021)","key":"7_CR7","DOI":"10.1142\/S0218196721400087"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"232","DOI":"10.4171\/GGD\/184","volume":"7","author":"IV Bondarenko","year":"2013","unstructured":"Bondarenko, I.V., Bondarenko, N.V., Sidki, S.N., Zapata, F.R.: On the conjugacy problem for finite-state automorphisms of regular rooted trees. Groups Geom. Dyn. 7, 232\u2013355 (2013)","journal-title":"Groups Geom. Dyn."},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"SA Cook","year":"1987","unstructured":"Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. J. Algorithms 8(3), 385\u2013394 (1987)","journal-title":"J. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"D\u2019Angeli, D., Rodaro, E., W\u00e4chter, J.Ph.: On the complexity of the word problem for automaton semigroups and automaton groups. Adv. in Appl. Math. 90, 160\u2013187 (2017)","key":"7_CR10","DOI":"10.1016\/j.aam.2017.05.008"},{"issue":"01","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218196714500015","volume":"24","author":"P Gillibert","year":"2014","unstructured":"Gillibert, P.: The finiteness problem for automaton semigroups is undecidable. Internat. J. Algebra Comput. 24(01), 1\u20139 (2014)","journal-title":"Internat. J. Algebra Comput."},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/j.jalgebra.2017.11.049","volume":"497","author":"P Gillibert","year":"2018","unstructured":"Gillibert, P.: An automaton group with undecidable order and Engel problems. J. Algebra 497, 363\u2013392 (2018)","journal-title":"J. Algebra"},{"issue":"3\u20134","key":"7_CR13","first-page":"251","volume":"54","author":"RI Grigorchuk","year":"2008","unstructured":"Grigorchuk, R.I., Pak, I.: Groups of intermediate growth: an introduction. Enseign. Math. 54(3\u20134), 251\u2013272 (2008)","journal-title":"Enseign. Math."},{"key":"7_CR14","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Boston (1979)"},{"issue":"3","key":"7_CR15","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1145\/322017.322031","volume":"24","author":"RJ Lipton","year":"1977","unstructured":"Lipton, R.J., Zalcstein, Y.: Word problems solvable in LogSpace. J. ACM 24(3), 522\u2013526 (1977)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Lohrey, M.: The Compressed Word Problem for Groups. SpringerBriefs in Mathematics, Springer (2014)","key":"7_CR16","DOI":"10.1007\/978-1-4939-0748-9"},{"key":"7_CR17","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/117","volume-title":"Self-similar groups, Mathematical Surveys and Monographs","author":"VV Nekrashevych","year":"2005","unstructured":"Nekrashevych, V.V.: Self-similar groups, Mathematical Surveys and Monographs, vol. 117. American Mathematical Society, Providence, RI (2005)"},{"unstructured":"Papadimitriou, C.M.: Computational Complexity. Addison-Wesley (1994)","key":"7_CR18"},{"doi-asserted-by":"crossref","unstructured":"Sidki, S.N.: Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity. J. Math. Sci. (N.Y.) 100(1), 1925\u20131943 (2000)","key":"7_CR19","DOI":"10.1007\/BF02677504"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-31623-4_4","volume-title":"Descriptional Complexity of Formal Systems","author":"PV Silva","year":"2012","unstructured":"Silva, P.V.: Groups and automata: a perfect match. In: Kutrib, M., Moreira, N., Reis, R. (eds.) Descriptional Complexity of Formal Systems, pp. 50\u201363. Springer, Berlin Heidelberg (2012)"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1090\/conm\/633\/12655","volume":"633","author":"B Steinberg","year":"2015","unstructured":"Steinberg, B.: On some algorithmic properties of finite state automorphisms of rooted trees. Contemp. Math. 633, 115\u2013123 (2015)","journal-title":"Contemp. Math."},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.jalgebra.2012.04.014","volume":"364","author":"Z \u0160uni\u0107","year":"2012","unstructured":"\u0160uni\u0107, Z., Ventura, E.: The conjugacy problem in automaton groups is not solvable. J. Algebra 364, 148\u2013154 (2012)","journal-title":"J. Algebra"},{"doi-asserted-by":"crossref","unstructured":"W\u00e4chter, J.Ph., Wei\u00df, A.: An automaton group with PSpace-complete word problem. Theory Comput. Syst. 67(1), 178\u2013218 (2022)","key":"7_CR23","DOI":"10.1007\/s00224-021-10064-7"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34326-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T11:05:29Z","timestamp":1687604729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34326-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343254","9783031343261"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34326-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Potsdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"4 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.uni-potsdam.de\/dcfs2023\/","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":"16","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":"14","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":"88% - 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":"2.35","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}