{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T05:06:38Z","timestamp":1742965598178,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030209803"},{"type":"electronic","value":"9783030209810"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-20981-0_7","type":"book-chapter","created":{"date-parts":[[2019,6,18]],"date-time":"2019-06-18T23:14:41Z","timestamp":1560899681000},"page":"91-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generic Properties in Some Classes of Automaton Groups"],"prefix":"10.1007","author":[{"given":"Thibault","family":"Godin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,14]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Adian, S.I.: The Burnside problem and identities in groups, Ergebnisse der Mathematik und ihrer Grenzgebiete 95 (1979)","DOI":"10.1007\/978-3-642-66932-3"},{"issue":"6","key":"7_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S021819671250052X","volume":"22","author":"A Akhavi","year":"2012","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), 1\u201326 (2012)","journal-title":"Int. J. Algebr. Comput."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-319-94812-6_7","volume-title":"Implementation and Application of Automata","author":"L Bartholdi","year":"2018","unstructured":"Bartholdi, L., Godin, T., Klimann, I., Picantin, M.: A new hierarchy for automaton semigroups. In: C\u00e2mpeanu, C. (ed.) CIAA 2018. LNCS, vol. 10977, pp. 71\u201383. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94812-6_7"},{"key":"7_CR4","unstructured":"Bartholdi, L., Mitrofanov, I.: The word and order problems for self-similar and automata groups (2017). arXiv:1710.10109"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1215\/S0012-7094-05-13012-5","volume":"130","author":"L Bartholdi","year":"2005","unstructured":"Bartholdi, L., Vir\u00e1g, B.: Amenability via random walks. Duke Math. J. 130(1), 39\u201356 (2005)","journal-title":"Duke Math. J."},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"323","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(2), 323\u2013355 (2013). With an appendix by R. M. Jungers. MR 3054572","journal-title":"Groups Geom. Dyn."},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-319-58741-7_23","volume-title":"Unveiling Dynamics and Complexity","author":"M Delacourt","year":"2017","unstructured":"Delacourt, M., Ollinger, N.: Permutive one-way cellular automata and the finiteness problem for automaton groups. In: Kari, J., Manea, F., Petre, I. (eds.) CiE 2017. LNCS, vol. 10307, pp. 234\u2013245. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58741-7_23"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01110210","volume":"110","author":"JD Dixon","year":"1969","unstructured":"Dixon, J.D.: The probability of generating the symmetric group. Mathematische Zeitschrift 110(3), 199\u2013205 (1969)","journal-title":"Mathematische Zeitschrift"},{"key":"7_CR9","unstructured":"Francoeur, D., Mitrofanov, I.: On the existence of free subsemigroups in reversible automata semigroups (2018). arXiv:1811.04679"},{"issue":"1","key":"7_CR10","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. Int. J. Algebr. Comput. 24\u20131(1), 1\u20139 (2014)","journal-title":"Int. J. Algebr. Comput."},{"key":"7_CR11","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. Algebr. 497, 363\u2013392 (2018)","journal-title":"J. Algebr."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Godin, Th.: An analogue to Dixon\u2019s theorem for automaton groups. In: Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 164\u2013173 (2017)","DOI":"10.1137\/1.9781611974775.17"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15579-1_25"},{"key":"7_CR14","unstructured":"Grigorchuk, R.I.: On Burnside\u2019s problem on periodic groups. Akademiya Nauk SSSR. Funktsional$$^{\\prime }$$ny\u012d Analiz i ego Prilozheniya 14\u20131, 53\u201354 (1980)"},{"issue":"5","key":"7_CR15","first-page":"939","volume":"48\u20135","author":"RI Grigorchuk","year":"1984","unstructured":"Grigorchuk, R.I.: Degrees of growth of finitely generated groups and the theory of invariant means. Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya 48\u20135(5), 939\u2013985 (1984)","journal-title":"Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya"},{"key":"7_CR16","first-page":"134","volume":"231","author":"RI Grigorchuk","year":"2000","unstructured":"Grigorchuk, R.I., Nekrashevich, V.V., Sushchanski\u012d, V.I.: Automata, dynamical systems, and groups. Trudy Matematicheskogo Instituta Imeni V. A. Steklova. Rossi\u012dskaya Akademiya Nauk 231, 134\u2013214 (2000)","journal-title":"Trudy Matematicheskogo Instituta Imeni V. A. Steklova. Rossi\u012dskaya Akademiya Nauk"},{"key":"7_CR17","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"},{"issue":"4","key":"7_CR18","doi-asserted-by":"publisher","first-page":"847","DOI":"10.4171\/GGD\/110","volume":"4","author":"V Nekrashevych","year":"2010","unstructured":"Nekrashevych, V.: Free subgroups in groups acting on rooted trees. Groups Geom. Dyn. 4(4), 847\u2013862 (2010)","journal-title":"Groups Geom. Dyn."},{"key":"7_CR19","unstructured":"Olukoya, F.: The growth rates of automaton groups generated by reset automata (2017). arXiv:1708.07209"},{"key":"7_CR20","unstructured":"Picantin, M.: Automates, (semi)groupes, dualit\u00e9s, Habilitation \u00e1 diriger des recherches, Universit\u00e9 Paris Diderot (2017)"},{"issue":"1","key":"7_CR21","first-page":"26","volume":"62","author":"H Robbins","year":"1955","unstructured":"Robbins, H.: A remark on Stirling\u2019s formula. Am. Math. Mon. 62(1), 26\u201329 (1955)","journal-title":"Am. Math. Mon."},{"issue":"1","key":"7_CR22","first-page":"86","volume":"9","author":"A Russyev","year":"2010","unstructured":"Russyev, A.: Finite groups as groups of automata with no cycles with exit. Algebr. Discret. Math. 9(1), 86\u2013102 (2010)","journal-title":"Algebr. Discret. Math."},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"1925","DOI":"10.1007\/BF02677504","volume":"100","author":"S Sidki","year":"2000","unstructured":"Sidki, S.: Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity. J. Math. Sci. 100(1), 1925\u20131943 (2000). Algebra, 12","journal-title":"J. Math. Sci."},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Silva, P., Steinberg, B.: On a class of automata groups generalizing lamplighter groups. 15, 1213\u20131234 (2005)","DOI":"10.1142\/S0218196705002761"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10711-006-9060-5","volume":"124","author":"M Vorobets","year":"2007","unstructured":"Vorobets, M., Vorobets, Y.: On a free group of transformations defined by an automaton. Geometriae Dedicata 124, 237\u2013249 (2007)","journal-title":"Geometriae Dedicata"},{"issue":"2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s00222-003-0321-8","volume":"155","author":"JS Wilson","year":"2004","unstructured":"Wilson, J.S.: On exponential growth and uniformly exponential growth for groups. Invent. Math. 155(2), 287\u2013303 (2004). MR 2031429","journal-title":"Invent. Math."}],"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-20981-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,19]],"date-time":"2023-06-19T00:02:34Z","timestamp":1687132954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-20981-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209803","9783030209810"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20981-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 May 2019","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":"Guadalajara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","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":"automata2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/automata2019.wordpress.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":"10","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":"7","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":"70% - 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":"1","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}