{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:06Z","timestamp":1725493446379},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76336-9_25","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T05:44:48Z","timestamp":1193463888000},"page":"265-276","source":"Crossref","is-referenced-by-count":3,"title":["Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms"],"prefix":"10.1007","author":[{"given":"Magnus","family":"Steinby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u0103t\u0103lin Ionu\u0163","family":"T\u00eern\u0103uc\u0103","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics\u00a023(2), 269\u2013311 (1997)","journal-title":"Computational Linguistics"},{"issue":"2","key":"25_CR2","first-page":"263","volume":"19","author":"P.F. Brown","year":"1993","unstructured":"Brown, P.F., Della Pietra, S.A., Della Pietra, V.J., Mercer, R.L.: The mathematics of statistical machine translation: Parameter estimation. Computational Linguistics\u00a019(2), 263\u2013312 (1993)","journal-title":"Computational Linguistics"},{"key":"25_CR3","first-page":"421","volume-title":"Proc. of the AMTA 1998","author":"K. Knight","year":"1998","unstructured":"Knight, K., Al-Onaizan, Y.: Translation with finite-state devices. In: Farwell, D., Gerber, L., Hovy, E. (eds.) Proc. of the AMTA 1998, pp. 421\u2013437. Springer, London, UK (1998)"},{"issue":"1","key":"25_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/366062.366083","volume":"4","author":"E.T. Irons","year":"1961","unstructured":"Irons, E.T.: A syntax directed compiler for ALGOL 60. Communications of the ACM\u00a04(1), 51\u201355 (1961)","journal-title":"Communications of the ACM"},{"key":"25_CR5","volume-title":"The Theory of Parsing, Translation, and Compiling","author":"A.V. Aho","year":"1972","unstructured":"Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol.\u00a01: Parsing. Prentice Hall Professional Technical Reference, New Jersey (1972)"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"K. Knight","year":"2005","unstructured":"Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol.\u00a03406, pp. 1\u201324. Springer, Heidelberg (2005)"},{"unstructured":"Graehl, J., Hopkins, M., Knight, K.: Extended top-down tree transducers. submitted to HLT-NAACL 2006, New York, USA (2006)","key":"25_CR7"},{"unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)","key":"25_CR8"},{"key":"25_CR9","first-page":"1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol.\u00a03. Beyond Words, pp. 1\u201368. Springer, Heidelberg (1997)"},{"issue":"3","key":"25_CR10","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BF01704020","volume":"9","author":"J. Engelfriet","year":"1975","unstructured":"Engelfriet, J.: Bottom-up and top-down tree transformations - a comparison. Mathematical Systems Theory\u00a09(3), 198\u2013231 (1975)","journal-title":"Mathematical Systems Theory"},{"issue":"2","key":"25_CR11","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/S0019-9958(79)90561-8","volume":"41","author":"B.S. Baker","year":"1979","unstructured":"Baker, B.S.: Composition of top-down and bottom-up tree transductions. Information and Control\u00a041(2), 186\u2013213 (1979)","journal-title":"Information and Control"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0304-3975(82)90098-6","volume":"20","author":"A. Arnold","year":"1982","unstructured":"Arnold, A., Dauchet, M.: Morphismes et bimorphismes d\u2019arbres. Theoretical Computer Science\u00a020, 33\u201393 (1982)","journal-title":"Theoretical Computer Science"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1007\/3-540-08342-1_41","volume-title":"ICALP 1977","author":"M. Takahashi","year":"1977","unstructured":"Takahashi, M.: Rational relations of binary trees. In: Salomaa, A., Steinby, M. (eds.) ICALP 1977. LNCS, vol.\u00a072, pp. 524\u2013538. Springer, Heidelberg (1977)"},{"issue":"2","key":"25_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0304-3975(92)90348-J","volume":"99","author":"S. Bozapalidis","year":"1992","unstructured":"Bozapalidis, S.: Alphabetic tree relations. Theoretical Computer Science\u00a099(2), 177\u2013211 (1992)","journal-title":"Theoretical Computer Science"},{"unstructured":"Steinby, M.: On certain algebraically defined tree transformations. In: Demetrovics, J., Budach, L., Salomaa, A. (eds.) Algebra, Combinatorics and Logic in Computer Science, vol. I, II (Gy\u00f6r 1983). Colloquia Mathematica Societatis J\u00e1nos Bolyai, North-Holland, vol.\u00a042, pp. 745\u2013764 (1986)","key":"25_CR15"},{"unstructured":"Shieber, S.M.: Synchronous grammars as tree transducers. In: Proc. of the TAG+ 7, Vancouver, Canada (2004)","key":"25_CR16"},{"unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), available online \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata","key":"25_CR17"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:48:10Z","timestamp":1619520490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540763352"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_25","relation":{},"subject":[]}}