{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:06Z","timestamp":1725467406299},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_88","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:17:05Z","timestamp":1153131425000},"page":"196-210","source":"Crossref","is-referenced-by-count":0,"title":["The use of tree transducers to compute translations between graph algebras"],"prefix":"10.1007","author":[{"given":"Frank","family":"Drewes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(79)90561-8","volume":"41","author":"B. S. Baker","year":"1979","unstructured":"Brenda S. Baker. Composition of top-down and bottom-up tree transductions. Information and Control 41, 186\u2013213, 1979.","journal-title":"Information and Control"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","volume":"20","author":"M. Bauderon","year":"1987","unstructured":"Michel Bauderon, Bruno Courcelle. Graph expressions and graph rewriting. Mathematical Systems Theory 20, 83\u2013127, 1987.","journal-title":"Mathematical Systems Theory"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B. Courcelle","year":"1991","unstructured":"Bruno Courcelle. The monadic second-order logic of graphs V: on closing the gap between definability and recognizability. Theoretical Computer Science 80, 153\u2013202, 1991.","journal-title":"Theoretical Computer Science"},{"key":"14_CR4","unstructured":"Frank Drewes. The use of tree transducers to compute translations between graph algebras. Report 8\/94, Univ. Bremen, 1994."},{"issue":"3","key":"14_CR5","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF01704020","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"Joost Engelfriet. Bottom-up and top-down tree transformations \u2014 a comparison. Mathematical Systems Theory 9(3), 198\u2013231, 1975.","journal-title":"Mathematical Systems Theory"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0020-0190(78)90060-1","volume":"7","author":"J. Engelfriet","year":"1978","unstructured":"Joost Engelfriet. On tree transducers for partial functions. Information Processing Letters 7, 170\u2013172, 1978.","journal-title":"Information Processing Letters"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/B978-0-12-115350-2.50014-2","volume-title":"Formal Language Theory: Perspectives and Open Problems","author":"J. Engelfriet","year":"1980","unstructured":"Joost Engelfriet. Some open questions and recent results on tree transducers and tree languages. In R.V. Book, editor, Formal Language Theory: Perspectives and Open Problems, 241\u2013286. Academic Press, New York, 1980."},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BFb0017471","volume":"787","author":"J. Engelfriet","year":"1994","unstructured":"Joost Engelfriet. Graph grammars and tree transducers. In Proc. CAAP 94, Lecture Notes in Computer Science 787, 15\u201337, 1994.","journal-title":"Lecture Notes in Computer Science"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0022-0000(05)80050-9","volume":"49","author":"J. Engelfriet","year":"1994","unstructured":"Joost Engelfriet, Heiko Vogler. The translation power of top-down tree-to-graph transducers. Journal of Computer and System Sciences 49, 258\u2013305, 1994.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"14_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J. E. Hopcroft","year":"1973","unstructured":"J. E. Hopcroft, R. E. Tarjan. Dividing a graph into triconnected components. SIAM Journal on Computing 2(3), 135\u2013158, 1973.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1215\/S0012-7094-37-00336-3","volume":"3","author":"S. MacLane","year":"1937","unstructured":"S. MacLane. A structural characterization of planar combinatorial graphs. Duke Mathematical Journal 3, 460\u2013472, 1937.","journal-title":"Duke Mathematical Journal"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Walter Vogler. Recognizing edge replacement graph languages in cubic time. In H. Ehrig, Hans-J\u00f6rg Kreowski, G. Rozenberg, editors, Proc. Fourth Intl. Workshop on Graph Grammars and Their Application to Comp. Sci., Lecture Notes in Computer Science 532, 676\u2013687, 1991.","DOI":"10.1007\/BFb0017421"}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61228-9_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T06:26:13Z","timestamp":1549434373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}