{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:13:09Z","timestamp":1725549189123},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_6","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"57-67","source":"Crossref","is-referenced-by-count":3,"title":["Code Selection by Tree Series Transducers"],"prefix":"10.1007","author":[{"given":"Bj\u00f6rn","family":"Borchardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(87)90190-6","volume":"24","author":"A. Alexandrakis","year":"1987","unstructured":"Alexandrakis, A., Bozapalidis, S.: Weighted grammars and Kleenes theorem. Information Processing Letters\u00a024(1), 1\u20134 (1987)","journal-title":"Information Processing Letters"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J. Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoretical Computer Science\u00a018(2), 115\u2013148 (1982)","journal-title":"Theoretical Computer Science"},{"key":"6_CR3","first-page":"11","volume":"7","author":"J. Engelfriet","year":"2002","unstructured":"Engelfriet, J., F\u00fcl\u00f6op, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Automata, Languages and Combinatorics\u00a07, 11\u201370 (2002)","journal-title":"J. Automata, Languages and Combinatorics"},{"issue":"8","key":"6_CR4","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1007\/BF01178733","volume":"31","author":"C. Ferdinand","year":"1994","unstructured":"Ferdinand, C., Seidl, H., Wilhelm, R.: Tree automata for code selection. Acta Informatica\u00a031(8), 741\u2013760 (1994)","journal-title":"Acta Informatica"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Glanville, R.S., Graham, S.L.: A new method for compiler code generation. In: Proceedings of the 5th ACM Symposium on Principles of Programming Languages, pp. 231\u2013240 (1978)","DOI":"10.1145\/512760.512785"},{"key":"6_CR6","unstructured":"Gough, K.J., Ledermann, J.: Optimal code-selection using MBURG. Presented to the 20th Australian Computer Science Conference, Sydney (1997)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C. Hoffmann","year":"1982","unstructured":"Hoffmann, C., O\u2019Donnell, M.J.: Pattern matching in trees. J. ACM\u00a029, 68\u201395 (1982)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:22Z","timestamp":1605761842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}