{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:24:07Z","timestamp":1775053447722,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319214993","type":"print"},{"value":"9783319215006","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_25","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"313-325","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group"],"prefix":"10.1007","author":[{"given":"Ines","family":"Klimann","sequence":"first","affiliation":[]},{"given":"Matthieu","family":"Picantin","sequence":"additional","affiliation":[]},{"given":"Dmytro","family":"Savchuk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Akhavi, A., Klimann, I., Lombardy, S., Mairesse, J., Picantin, M.: On the finiteness problem for automaton (semi)groups. Int. J. Algebr. Comput. 22(6) (2012)","DOI":"10.1142\/S021819671250052X"},{"key":"25_CR2","first-page":"319","volume":"11","author":"SV Ale\u0161in","year":"1972","unstructured":"Ale\u0161in, S.V.: Finite automata and the Burnside problem for periodic groups. Mat. Zametki 11, 319\u2013328 (1972)","journal-title":"Mat. Zametki"},{"key":"25_CR3","unstructured":"Bartholdi, L.: FR functionally recursive groups, self-similar groups, GAP package for computation in self-similar groups and semigroups, V. 2.2.1 (2015)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"4923","DOI":"10.1081\/AGB-100106794","volume":"29\u201311","author":"L Bartholdi","year":"2001","unstructured":"Bartholdi, L., \u0160uni\u1e31, Z.: On the word and period growth of some groups of tree automorphisms. Comm. Algebra 29\u201311, 4923\u20134964 (2001)","journal-title":"Comm. Algebra"},{"key":"25_CR5","unstructured":"Belk, J., Bleak, C.: Some undecidability results for asynchronous transducers and the Brin-Thompson group $$2{V}$$.  ArXiv:1405.0982"},{"key":"25_CR6","first-page":"230","volume":"33","author":"W Burnside","year":"1902","unstructured":"Burnside, W.: On an unsettled question in the theory of discontinuous groups. Quart. J. Math. 33, 230\u2013238 (1902)","journal-title":"Quart. J. Math."},{"key":"25_CR7","unstructured":"D\u2019Angeli, D., Rodaro, E.: Freeness of automata groups vs boundary dynamics.  ArXiv:1410.6097v2"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10711-014-0024-x","volume":"174","author":"D D\u2019Angeli","year":"2015","unstructured":"D\u2019Angeli, D., Rodaro, E.: A geometric approach to (semi)-groups defined by automata via dual transducers. Geometriae Dedicata 174(1), 375\u2013400 (2015)","journal-title":"Geometriae Dedicata"},{"key":"25_CR9","unstructured":"The GAP Group: GAP Groups, Algorithms, and Programming (2015)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1142\/S021819670100070X","volume":"11\u20135","author":"PW Gawron","year":"2001","unstructured":"Gawron, P.W., Nekrashevych, V.V., Sushchansky, V.I.: Conjugation in tree automorphism groups. Internat. J. Algebr. Comput. 11\u20135, 529\u2013547 (2001)","journal-title":"Internat. J. Algebr. Comput."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218196714500015","volume":"24\u20131","author":"P Gillibert","year":"2014","unstructured":"Gillibert, P.: The finiteness problem for automaton semigroups is undecidable. Internat. J. Algebr. Comput. 24\u20131, 1\u20139 (2014)","journal-title":"Internat. J. Algebr. Comput."},{"issue":"5","key":"25_CR12","first-page":"3","volume":"16","author":"VM Glu\u0161kov","year":"1961","unstructured":"Glu\u0161kov, V.M.: Abstract theory of automata. Uspehi Mat. Nauk 16(5), 3\u201362 (1961)","journal-title":"Uspehi Mat. Nauk"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1007\/978-3-319-15579-1_25","volume-title":"Language and Automata Theory and Applications","author":"T Godin","year":"2015","unstructured":"Godin, T., Klimann, I., Picantin, M.: On Torsion-Free Semigroups Generated by\u00a0Invertible Reversible Mealy Automata. In: Dediu, A.-H., Formenti, E., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 328\u2013339. Springer, Heidelberg (2015)"},{"key":"25_CR14","first-page":"261","volume":"28","author":"ES Golod","year":"1964","unstructured":"Golod, E.S., Shafarevich, I.: On the class field tower. Izv. Akad. Nauk SSSR Ser. Mat. 28, 261\u2013272 (1964)","journal-title":"Izv. Akad. Nauk SSSR Ser. Mat."},{"issue":"1","key":"25_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01078416","volume":"14","author":"R Grigorchuk","year":"1980","unstructured":"Grigorchuk, R.: On Burnside\u2019s problem on periodic groups. Funktsional. Anal. i Prilozhen 14(1), 53\u201354 (1980)","journal-title":"Funktsional. Anal. i Prilozhen"},{"issue":"5","key":"25_CR16","first-page":"939","volume":"48","author":"R Grigorchuk","year":"1984","unstructured":"Grigorchuk, R.: Degrees of growth of finitely generated groups and the theory of invariant means. Izv. Akad. Nauk SSSR Ser. Mat. 48(5), 939\u2013985 (1984)","journal-title":"Izv. Akad. Nauk SSSR Ser. Mat."},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Grigorchuk, R., Savchuk, D.: Ergodic decomposition of group actions on rooted trees. In: Proc. of Steklov Inst. of Math. (to appear, 2015)","DOI":"10.1134\/S0081543816010065"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01179757","volume":"182\u20133","author":"N Gupta","year":"1983","unstructured":"Gupta, N., Sidki, S.: On the Burnside problem for periodic groups. Math. Z. 182\u20133, 385\u2013388 (1983)","journal-title":"Math. Z."},{"key":"25_CR19","unstructured":"Klimann, I.: Automaton semigroups: The two-state case. Theor. Comput. Syst., 1\u201317 (special issue STACS 2013) (2014)"},{"key":"25_CR20","unstructured":"Klimann, I., Picantin, M., Savchuk, D.: Orbit automata as a new tool to attack the order problem in automaton groups.  ArXiv:1411.0158v2"},{"key":"25_CR21","unstructured":"Muntyan, Y., Savchuk, D.: automgrp automata groups, GAP package for computation in self-similar groups and semigroups, V. 1.2.4 (2014)"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Nekrashevych, V.: Self-similar groups, Mathematical Surveys and Monographs, vol. 117. American Mathematical Society, Providence (2005)","DOI":"10.1090\/surv\/117\/04"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jalgebra.2011.02.049","volume":"336\u20131","author":"D Savchuk","year":"2011","unstructured":"Savchuk, D., Vorobets, Y.: Automata generating free products of groups of order 2. J. Algebra 336\u20131, 53\u201366 (2011)","journal-title":"J. Algebra"},{"issue":"3","key":"25_CR24","first-page":"557","volume":"247","author":"VI Sushchansky","year":"1979","unstructured":"Sushchansky, V.I.: Periodic permutation $$p$$-groups and the unrestricted Burnside problem. DAN SSSR. 247(3), 557\u2013562 (1979). (in Russian)","journal-title":"DAN SSSR."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:19:01Z","timestamp":1675138741000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}