{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:02Z","timestamp":1725564602253},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212362"},{"type":"electronic","value":"9783540247494"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_38","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T19:01:54Z","timestamp":1283972514000},"page":"428-439","source":"Crossref","is-referenced-by-count":1,"title":["On the Expressiveness of Deterministic Transducers over Infinite Trees"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Colcombet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christof","family":"L\u00f6ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","unstructured":"Barthelmann, K.: On equational simple graphs. Technical Report 9, Universit\u00e4t Mainz, Institut f\u00fcr Informatik (1997)"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/BFb0055804","volume-title":"Mathematical Foundations of Computer Science 1998","author":"K. Barthelmann","year":"1998","unstructured":"Barthelmann, K.: When can an equational simple graph be generated by hyperedge replacement? In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 543\u2013552. Springer, Heidelberg (1998)"},{"key":"38_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-36387-4_16","volume-title":"Automata, Logics, and Infinite Games","author":"D. Berwanger","year":"2002","unstructured":"Berwanger, D., Blumensath, A.: The monadic theory of tree-like structures. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500, ch. 16, pp. 285\u2013301. Springer, Heidelberg (2002)"},{"issue":"1","key":"38_CR4","first-page":"1","volume":"61","author":"R. Bloem","year":"2000","unstructured":"Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. JCSS\u00a061(1), 1\u201350 (2000)","journal-title":"JCSS"},{"key":"38_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-24597-1_10","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Carayol","year":"2003","unstructured":"Carayol, A., W\u00f6hrle, S.: The caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 112\u2013123. Springer, Heidelberg (2003)"},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D. Caucal","year":"2002","unstructured":"Caucal, D.: On infinite terms having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 165\u2013176. Springer, Heidelberg (2002)"},{"key":"38_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45465-9_10","volume-title":"Automata, Languages and Programming","author":"T. Colcombet","year":"2002","unstructured":"Colcombet, T.: On families of graphs having a decidable first order theory with reachability. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, Springer, Heidelberg (2002)"},{"key":"38_CR8","unstructured":"Colcombet, T.: Propri\u00e9t\u00e9s et repr\u00e9sentations de structures infinies. PhD thesis, IRISA, Rennes (2004) (to appear)"},{"key":"38_CR9","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997)"},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02088013","volume":"21","author":"B. Courcelle","year":"1989","unstructured":"Courcelle, B.: The monadic second-order logic of graphs II: infinite graphs of bounded tree width. Mathematical Systems Theory\u00a021, 187\u2013221 (1989)","journal-title":"Mathematical Systems Theory"},{"key":"38_CR11","first-page":"53","volume-title":"TCS","author":"B. Courcelle","year":"1994","unstructured":"Courcelle, B.: Monadic second-order graph transductions: A survey. In: TCS, vol.\u00a0126, pp. 53\u201375. Elsevier, Amsterdam (1994)"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second order logic of graphs IX: Machines and their behaviours. In: TCS, vol.\u00a0151, pp. 125\u2013162 (1995)","DOI":"10.1016\/0304-3975(95)00049-3"},{"key":"38_CR13","unstructured":"Drewes, F.: The use of tree transducers to compute translations between graph algebras. Report 8\/94, Univ. Bremen (1994)"},{"key":"38_CR14","volume-title":"Perspectives in Mathematical Logic","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. In: Perspectives in Mathematical Logic, 2nd edn., Springer, Berlin (1995)","edition":"2"},{"key":"38_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF01683280","volume":"10","author":"J. Engelfriet","year":"1977","unstructured":"Engelfriet, J.: Top-down tree transducers with regular lookahead. Mathematical Systems Theory\u00a010, 289\u2013303 (1977)","journal-title":"Mathematical Systems Theory"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BFb0017471","volume-title":"Trees in Algebra and Programming - CAAP \u201994","author":"J. Engelfriet","year":"1994","unstructured":"Engelfriet, J.: Graph grammars and tree transducers. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 15\u201336. Springer, Heidelberg (1994)"},{"key":"38_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/3-540-46541-3_45","volume-title":"STACS 2000","author":"J. Engelfriet","year":"2000","unstructured":"Engelfriet, J., Maneth, S.: Characterizing and deciding MSO-definability of macro tree transductions. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, p. 542. Springer, Heidelberg (2000)"},{"key":"38_CR18","first-page":"71","volume":"31","author":"J. Engelfriet","year":"1985","unstructured":"Engelfriet, J., Vogler, H.: Macro tree transducers. JCSS\u00a031, 71\u2013146 (1985)","journal-title":"JCSS"},{"key":"38_CR19","first-page":"258","volume":"49","author":"J. Engelfriet","year":"1994","unstructured":"Engelfriet, J., Vogler, H.: The translation power of top-down tree-to-graph transducers. JCSS\u00a049, 258\u2013305 (1994)","journal-title":"JCSS"},{"key":"38_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-45931-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"T. Knapik","year":"2002","unstructured":"Knapik, T., Niwinski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 205\u2013222. Springer, Heidelberg (2002)"},{"key":"38_CR21","first-page":"1","volume":"141","author":"M.O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society\u00a0141, 1\u201335 (1969)","journal-title":"Transactions of the American Mathematical Society"},{"key":"38_CR22","volume-title":"Graduate Texts in Computer Science","author":"C. Stirling","year":"2001","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. In: Graduate Texts in Computer Science, Springer, Heidelberg (2001)"},{"key":"38_CR23","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Language Theory","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata, and logic. In: Handbook of Formal Language Theory, vol.\u00a0III, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"38_CR24","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(01)00185-2","volume":"275","author":"I. Walukiewicz","year":"2002","unstructured":"Walukiewicz, I.: Monadic second-order logic on tree-like structures. TCS\u00a0275, 311\u2013346 (2002)","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T05:33:44Z","timestamp":1559626424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}