{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:42:41Z","timestamp":1725500561367},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540775652"},{"type":"electronic","value":"9783540775669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77566-9_37","type":"book-chapter","created":{"date-parts":[[2008,1,5]],"date-time":"2008-01-05T06:18:43Z","timestamp":1199513923000},"page":"424-435","source":"Crossref","is-referenced-by-count":1,"title":["An Automata Theoretic Approach to Rational Tree Relations"],"prefix":"10.1007","author":[{"given":"Frank G.","family":"Radmacher","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Leitf\u00e4den der angewandten Mathematik und Mechanik 38. Teubner, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"37_CR2","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: Automata and interpretations. Theory of Computing Systems\u00a037, 641\u2013674 (2004)","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1051\/ita:2006005","volume":"40","author":"O. Carton","year":"2006","unstructured":"Carton, O., Choffrut, C., Grigorieff, S.: Decision problems among the main subfamilies of rational relations. Theor. Informat. Appl.\u00a040(2), 255\u2013275 (2006)","journal-title":"Theor. Informat. Appl."},{"key":"37_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Unpublished electronic book (1997), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/11537311_7","volume-title":"Fundamentals of Computation Theory","author":"J. Cristau","year":"2005","unstructured":"Cristau, J., L\u00f6ding, C., Thomas, W.: Deterministic automata on unranked trees. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 68\u201379. Springer, Heidelberg (2005)"},{"key":"37_CR6","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, New York (1974)"},{"issue":"1","key":"37_CR7","doi-asserted-by":"crossref","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 Journal of Research and Development\u00a09(1), 47\u201368 (1965)","journal-title":"IBM Journal of Research and Development"},{"issue":"1","key":"37_CR8","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0022-0000(68)80006-6","volume":"2","author":"P.C. Fischer","year":"1968","unstructured":"Fischer, P.C., Rosenberg, A.L.: Multitape one-way nonwriting automata. Journal of Computer and System Sciences\u00a02(1), 88\u2013101 (1968)","journal-title":"Journal of Computer and System Sciences"},{"key":"37_CR9","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata, Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"37_CR10","first-page":"1","volume-title":"Handbook of Formal Languages, Beyond Words","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Languages. In: Handbook of Formal Languages, Beyond Words, vol.\u00a03, pp. 1\u201368. Springer, Heidelberg (1997)"},{"issue":"1-2","key":"37_CR11","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/S0304-3975(02)00022-1","volume":"281","author":"S. Grigorieff","year":"2002","unstructured":"Grigorieff, S.: Modelization of deterministic rational relations. Theoretical Computer Science\u00a0281(1-2), 423\u2013453 (2002)","journal-title":"Theoretical Computer Science"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-540-24727-2_27","volume-title":"Foundations of Software Science and Computation Structures","author":"A. Meyer","year":"2004","unstructured":"Meyer, A.: On term rewriting systems having a rational derivation. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 378\u2013392. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"37_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(98)00179-0","volume":"225","author":"M. Pelletier","year":"1999","unstructured":"Pelletier, M., Sakarovitch, J.: On the representation of finite deterministic 2-tape automata. Theoretical Computer Science\u00a0225(1-2), 1\u201363 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"37_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M.O. Rabin","year":"1959","unstructured":"Rabin, M.O., Scott, D.: Finite automata and their decision problems. IBM Journal of Research and Development\u00a03(2), 115\u2013125 (1959)","journal-title":"IBM Journal of Research and Development"},{"key":"37_CR15","unstructured":"Radmacher, F.G.: An automata theoretic approach to the theory of rational tree relations. Tech. Rep. (2007), http:\/\/www.automata.rwth-aachen.de\/~radmacher\/"},{"key":"37_CR16","unstructured":"Radmacher, F.G.: Automatendefinierbare Relationen \u00fcber B\u00e4umen (Automata Definable Relations over Trees). Diploma thesis (revised version), RWTH Aachen (2007), http:\/\/www.automata.rwth-aachen.de\/~radmacher\/"},{"key":"37_CR17","first-page":"311","volume-title":"Tree Automata and Languages","author":"J.-C. Raoult","year":"1992","unstructured":"Raoult, J.-C.: A survey of tree transductions. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages, pp. 311\u2013326. Elsevier, Amsterdam (1992) (also published as report 1410 INRIA-Rennes, 1991)"},{"issue":"1","key":"37_CR18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.36045\/bbms\/1105730627","volume":"4","author":"J.-C. Raoult","year":"1997","unstructured":"Raoult, J.-C.: Rational tree relations. Bulletin of the Belgian Mathematical Society\u00a04(1), 149\u2013176 (1997)","journal-title":"Bulletin of the Belgian Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2008: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77566-9_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:10:11Z","timestamp":1606183811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77566-9_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540775652","9783540775669"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77566-9_37","relation":{},"subject":[]}}