{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:04Z","timestamp":1746115864275,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642393099"},{"type":"electronic","value":"9783642393105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39310-5_4","type":"book-chapter","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T01:33:15Z","timestamp":1371173595000},"page":"18-29","source":"Crossref","is-referenced-by-count":0,"title":["Invertible Transductions and Iteration"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Sutner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Bartholdi, L., Silva, P.V.: Groups defined by automata. In: CoRR, abs\/1012.1531 (2010)"},{"key":"4_CR2","unstructured":"Berstel, J.: Transductions and context-free languages (2009), http:\/\/www-igm.univ-mlv.fr\/~berstel\/LivreTransductions\/LivreTransductions.html"},{"issue":"1","key":"4_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.25088\/ComplexSystems.15.1.1","volume":"15","author":"M. Cook","year":"2004","unstructured":"Cook, M.: Universality in elementary cellular automata. Complex Systems\u00a015(1), 1\u201340 (2004)","journal-title":"Complex Systems"},{"issue":"4","key":"4_CR4","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1016\/j.ic.2011.01.006","volume":"209","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Grochow, J.A.: Complexity classes of equivalence problems revisited. Inf. Comput.\u00a0209(4), 748\u2013763 (2011)","journal-title":"Inf. Comput."},{"key":"4_CR5","first-page":"3","volume":"16","author":"V.M. Glu\u0161kov","year":"1961","unstructured":"Glu\u0161kov, V.M.: Abstract theory of automata. Uspehi Mat. Nauk.\u00a016(5(101)), 3\u201362 (1961)","journal-title":"Uspehi Mat. Nauk"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Grigorchuk, R., \u0160uni\u0107, Z.: Self-Similarity and Branching in Group Theory. In: Groups St. Andrews 2005. London Math. Soc. Lec. Notes, vol.\u00a0339. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511721212.003"},{"key":"4_CR7","first-page":"128","volume":"231","author":"R.R. Grigorchuk","year":"2000","unstructured":"Grigorchuk, R.R., Nekrashevich, V.V., Sushchanski, V.I.: Automata, dynamical systems and groups. Proc. Steklov Institute of Math.\u00a0231, 128\u2013203 (2000)","journal-title":"Proc. Steklov Institute of Math."},{"key":"4_CR8","first-page":"167","volume":"47","author":"J. Howard Johnson","year":"1986","unstructured":"Howard Johnson, J.: Rational equivalence relations. Theoretical Computer Science\u00a047, 167\u2013176 (1986)","journal-title":"Theoretical Computer Science"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nerode, A.: Automata Theory and its Applications. Birkh\u00e4user (2001)","DOI":"10.1007\/978-1-4612-0171-7"},{"issue":"2","key":"4_CR11","first-page":"287","volume":"8","author":"B. Khoussainov","year":"2003","unstructured":"Khoussainov, B., Rubin, S.: Automatic structures: overview and future directions. J. Autom. Lang. Comb.\u00a08(2), 287\u2013301 (2003)","journal-title":"J. Autom. Lang. Comb."},{"key":"4_CR12","unstructured":"Knuth, D.: Private communication (2010)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0055778","volume-title":"Mathematical Foundations of Computer Science 1998","author":"M. Latteux","year":"1998","unstructured":"Latteux, M., Simplot, D., Terlutte, A.: Iterated length-preserving rational transductions. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 286\u2013295. Springer, Heidelberg (1998)"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/11786986_13","volume-title":"Automata, Languages and Programming","author":"T. Neary","year":"2006","unstructured":"Neary, T., Woods, D.: P-completeness of cellular automaton rule 110. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 132\u2013143. Springer, Heidelberg (2006)"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Nekrashevych, V.: Self-Similar Groups. AMS. Math. Surveys and Monographs, vol.\u00a0117 (2005)","DOI":"10.1090\/surv\/117\/04"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Nekrashevych, V., Sidki, S.: Automorphisms of the binary tree: state-closed subgroups and dynamics of 1\/2-endomorphisms. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511550706.014"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/320924.320930","volume":"5","author":"G.N. Raney","year":"1958","unstructured":"Raney, G.N.: Sequential functions. J. Assoc. Comp. Mach.\u00a05(2), 177\u2013180 (1958)","journal-title":"J. Assoc. Comp. Mach."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"4_CR19","unstructured":"Serre, J.-P.: Arbres, Amalgames, SL 2. Ast\u00e9risque Soci\u00e9t\u00e9 Math\u00e9matique de France, Paris (1977)"},{"issue":"1","key":"4_CR20","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. Sciences\u00a0100(1), 1925\u20131943 (2000)","journal-title":"J. Math. Sciences"},{"issue":"1","key":"4_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/jcss.1995.1009","volume":"50","author":"K. Sutner","year":"1995","unstructured":"Sutner, K.: On the computational complexity of finite cellular automata. J. Comput. System Sci.\u00a050(1), 87\u201397 (1995)","journal-title":"J. Comput. System Sci."},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-31834-7_4","volume-title":"Machines, Computations, and Universality","author":"K. Sutner","year":"2005","unstructured":"Sutner, K.: Universality and cellular automata. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol.\u00a03354, pp. 50\u201359. Springer, Heidelberg (2005)"},{"issue":"6","key":"4_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/03081079.2012.695899","volume":"41","author":"K. Sutner","year":"2012","unstructured":"Sutner, K.: Computational classification of cellular automata. Int. J. General Systems\u00a041(6), 1\u201313 (2012)","journal-title":"Int. J. General Systems"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/978-3-642-39274-0_27","volume-title":"CIAA","author":"K. Sutner","year":"2013","unstructured":"Sutner, K.: Invertible transducers, iteration and coordinates. In: Konstantinidis, S. (ed.) CIAA 2013. LNCS, vol.\u00a07982, pp. 306\u2013318. Springer, Heidelberg (2013)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-31623-4_23","volume-title":"Descriptional Complexity of Formal Systems","author":"K. Sutner","year":"2012","unstructured":"Sutner, K., Lewi, K.: Iterating invertible binary transducers. In: Kutrib, M., Moreira, N., Reis, R. (eds.) DCFS 2012. LNCS, vol.\u00a07386, pp. 294\u2013306. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39310-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T12:12:15Z","timestamp":1746015135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39310-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642393099","9783642393105"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39310-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}