{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:22:53Z","timestamp":1766269373600,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587400"},{"type":"electronic","value":"9783319587417"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58741-7_23","type":"book-chapter","created":{"date-parts":[[2017,5,11]],"date-time":"2017-05-11T16:59:28Z","timestamp":1494521968000},"page":"234-245","source":"Crossref","is-referenced-by-count":5,"title":["Permutive One-Way Cellular Automata and the Finiteness Problem for Automaton Groups"],"prefix":"10.1007","author":[{"given":"Martin","family":"Delacourt","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Ollinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,12]]},"reference":[{"issue":"06","key":"23_CR1","doi-asserted-by":"crossref","first-page":"1250052","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. Algebra Comput. 22(06), 1250052 (2012)","journal-title":"Int. J. Algebra Comput."},{"issue":"5","key":"23_CR2","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(72)80013-8","volume":"6","author":"S Amoroso","year":"1972","unstructured":"Amoroso, S., Patt, Y.N.: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures. J. Comput. Syst. Sci. 6(5), 448\u2013464 (1972)","journal-title":"J. Comput. Syst. Sci."},{"key":"23_CR3","unstructured":"Bartholdi, L., Silva, P.V.: Groups defined by automata. In: AutoMathA Handbook (to appear). https:\/\/arxiv.org\/abs\/1012.1531"},{"issue":"4","key":"23_CR4","doi-asserted-by":"crossref","first-page":"725","DOI":"10.2969\/jmsj\/05240725","volume":"52","author":"M Boyle","year":"2000","unstructured":"Boyle, M., Maass, A., et al.: Expansive invertible onesided cellular automata. J. Math. Soc. Jpn. 52(4), 725\u2013740 (2000)","journal-title":"J. Math. Soc. Jpn."},{"issue":"2","key":"23_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V Bruyere","year":"1994","unstructured":"Bruyere, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and p-recognizable sets of integers. Bull. Belg. Math. Soc. Simon Stevin 1(2), 191\u2013238 (1994)","journal-title":"Bull. Belg. Math. Soc. Simon Stevin"},{"issue":"3","key":"23_CR6","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1090\/S0002-9939-06-08754-5","volume":"135","author":"E Coven","year":"2007","unstructured":"Coven, E., Pivato, M., Yassawi, R.: Prevalence of odometers in cellular automata. Proc. Am. Math. Soc. 135(3), 815\u2013821 (2007)","journal-title":"Proc. Am. Math. Soc."},{"issue":"1\u20133","key":"23_CR7","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0304-3975(03)00290-1","volume":"304","author":"P Dartnell","year":"2003","unstructured":"Dartnell, P., Maass, A., Schwartz, F.: Combinatorial constructions associated to the dynamics of onesided cellular automata. Theoret. Comput. Sci. 304(1\u20133), 485\u2013497 (2003)","journal-title":"Theoret. Comput. Sci."},{"issue":"30","key":"23_CR8","doi-asserted-by":"crossref","first-page":"3881","DOI":"10.1016\/j.tcs.2011.02.024","volume":"412","author":"M Delorme","year":"2011","unstructured":"Delorme, M., Mazoyer, J., Ollinger, N., Theyssier, G.: Bulking II: classifications of cellular automata. Theoret. Comput. Sci. 412(30), 3881\u20133905 (2011)","journal-title":"Theoret. Comput. Sci."},{"issue":"01","key":"23_CR9","doi-asserted-by":"crossref","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. Int. J. Algebra Comput. 24(01), 1\u20139 (2014)","journal-title":"Int. J. Algebra Comput."},{"issue":"5","key":"23_CR10","first-page":"3","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Uspekhi Matematicheskikh Nauk 16(5), 3\u201362 (1961)","journal-title":"Uspekhi Matematicheskikh Nauk"},{"issue":"4","key":"23_CR11","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"GA Hedlund","year":"1969","unstructured":"Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical systems. Math. Syst. Theory 3(4), 320\u2013375 (1969)","journal-title":"Math. Syst. Theory"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-540-85238-4_34","volume-title":"Mathematical Foundations of Computer Science 2008","author":"J Kari","year":"2008","unstructured":"Kari, J., Ollinger, N.: Periodicity and immortality in reversible computing. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 419\u2013430. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85238-4_34"},{"issue":"3","key":"23_CR13","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1137\/0221036","volume":"21","author":"J Kari","year":"1992","unstructured":"Kari, J.: The nilpotency problem of one-dimensional cellular automata. SIAM J. Comput. 21(3), 571\u2013586 (1992)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"23_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2004.11.021","volume":"334","author":"J Kari","year":"2005","unstructured":"Kari, J.: Theory of cellular automata: a survey. Theoret. Comput. Sci. 334(1), 3\u201333 (2005)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"23_CR15","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1007\/s00224-014-9594-0","volume":"58","author":"I Klimann","year":"2016","unstructured":"Klimann, I.: Automaton semigroups: the two-state case. Theory Comput. Syst. 58(4), 664\u2013680 (2016)","journal-title":"Theory Comput. Syst."},{"key":"23_CR16","doi-asserted-by":"crossref","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"}],"container-title":["Lecture Notes in Computer Science","Unveiling Dynamics and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58741-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,7]],"date-time":"2020-10-07T09:26:12Z","timestamp":1602062772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-58741-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587400","9783319587417"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58741-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}