{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:59:06Z","timestamp":1725890346823},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642316227"},{"type":"electronic","value":"9783642316234"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31623-4_23","type":"book-chapter","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T01:03:34Z","timestamp":1341795814000},"page":"294-306","source":"Crossref","is-referenced-by-count":5,"title":["Iterating Invertible Binary Transducers"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Sutner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Lewi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Bartholdi, L., Silva, P.V.: Groups defined by automata. CoRR, abs\/1012.1531 (2010)"},{"key":"23_CR2","unstructured":"Berstel, J.: Transductions and context-free languages (2009), http:\/\/www-igm.univ-mlv.fr\/~berstel\/LivreTransductions\/LivreTransductions.html"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. Journal Assoc. for Comp. Machinery\u00a011 (1964)","DOI":"10.1145\/321239.321249"},{"key":"23_CR4","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press (1974)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM J. Res. Dev.\u00a09, 47\u201368 (1965)","journal-title":"IBM J. Res. Dev."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Patterson, M.S., Thurston, W.P.: Word Processing in Groups. Jones and Bartlett (1992)","DOI":"10.1201\/9781439865699"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Glu\u0161kov, V.M.: Abstract theory of automata. Uspehi Mat. Nauk\u00a016(5(101)), 3\u201362 (1961)","DOI":"10.1070\/RM1961v016n05ABEH004112"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Gouv\u00eaa, F.Q.: p-Adic Numbers: An Introduction, 2nd edn. Springer (1997)","DOI":"10.1007\/978-3-642-59058-0"},{"key":"23_CR9","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":"23_CR10","unstructured":"Kharlampovich, O., Khoussainov, B.: A\u00a0Miasnikov. From automatic structures to automatic groups. ArXiv e-prints (July 2011)"},{"key":"23_CR11","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":"23_CR12","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":"23_CR13","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":"23_CR14","unstructured":"Knuth, D.: Private communication (2010)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Nekrashevych, V.: Self-Similar Groups. Math. Surveys and Monographs, vol.\u00a0117. AMS (2005)","DOI":"10.1090\/surv\/117\/04"},{"key":"23_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":"23_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":"23_CR18","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"23_CR19","unstructured":"Serre, J.-P.: Arbres, Amalgames, SL 2. Number\u00a046 in Ast\u00e9risque. Soci\u00e9t\u00e9 Math\u00e9matique de France, Paris (1977)"},{"issue":"1","key":"23_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"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Sutner, K., Devanny, W.: Timestamps in iterated invertible transducers (in preparation, 2012)","DOI":"10.1007\/978-3-642-31623-4_23"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1109\/12.295849","volume":"43","author":"J. Vuillemin","year":"1994","unstructured":"Vuillemin, J.: On circuits and numbers. IEEE Transactions on Computers\u00a043, 868\u2013879 (1994)","journal-title":"IEEE Transactions on Computers"}],"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-31623-4_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:40:39Z","timestamp":1620114039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31623-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642316227","9783642316234"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31623-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}