{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:28Z","timestamp":1725491428131},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372134"},{"type":"electronic","value":"9783540372141"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_15","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T05:32:31Z","timestamp":1155101551000},"page":"150-161","source":"Crossref","is-referenced-by-count":0,"title":["Does o-Substitution Preserve Recognizability?"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Maletti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","first-page":"11","volume":"7","author":"J. Engelfriet","year":"2002","unstructured":"Engelfriet, J., F\u00fcl\u00f6p, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Autom. Lang. Combin.\u00a07, 11\u201370 (2002)","journal-title":"J. Autom. Lang. Combin."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/BF01695769","volume":"4","author":"W.C. Rounds","year":"1970","unstructured":"Rounds, W.C.: Mappings and grammars on trees. Math. Systems Theory\u00a04, 257\u2013287 (1970)","journal-title":"Math. Systems Theory"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/S0022-0000(70)80017-4","volume":"4","author":"J.W. Thatcher","year":"1970","unstructured":"Thatcher, J.W.: Generalized2 sequential machine maps. J. Comput. System Sci.\u00a04, 339\u2013367 (1970)","journal-title":"J. Comput. System Sci."},{"key":"15_CR4","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. Theoret. Comput. Sci.\u00a018, 115\u2013148 (1982)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR5","unstructured":"Kuich, W.: Formal power series over trees. In: Bozapalidis, S. (ed.) Proc. 3rd Int. Conf. Develop. in Lang. Theory, Aristotle University of Thessaloniki, pp. 61\u2013101 (1998)"},{"key":"15_CR6","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. Commun. ACM\u00a04, 51\u201355 (1961)","journal-title":"Commun. ACM"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-48975-4_6","volume-title":"Logical Aspects of Computational Linguistics","author":"F. Morawietz","year":"1999","unstructured":"Morawietz, F., Cornell, T.: The MSO logic-automation connection in linguistics. In: Lecomte, A., Perrier, G., Lamarche, F. (eds.) LACL 1997. LNCS, vol.\u00a01582, pp. 112\u2013131. Springer, Heidelberg (1999)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0306-4379(01)00033-3","volume":"27","author":"G.J. Bex","year":"2002","unstructured":"Bex, G.J., Maneth, S., Neven, F.: A formal model for an expressive fragment of XSLT. Inform. Systems\u00a027, 21\u201339 (2002)","journal-title":"Inform. Systems"},{"key":"15_CR9","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 Inform.\u00a031, 741\u2013760 (1994)","journal-title":"Acta Inform."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(94)90271-2","volume":"126","author":"H. Seidl","year":"1994","unstructured":"Seidl, H.: Finite tree automata with cost functions. Theoret. Comput. Sci.\u00a0126, 113\u2013142 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-44522-6_14","volume-title":"Advances in Pattern Recognition","author":"D. L\u00f3pez","year":"2000","unstructured":"L\u00f3pez, D., Pi\u00f1aga, I.: Syntactic pattern recognition by error correcting analysis on tree automata. In: Ferri, F.J., Quereda, J.M.I., Amin, A., Pudil, P. (eds.) SPR 2000 and SSPR 2000. LNCS, vol.\u00a01876, pp. 133\u2013142. Springer, Heidelberg (2000)"},{"key":"15_CR12","unstructured":"Graehl, J., Knight, K.: Training tree transducers. In: HLT-NAACL, pp. 105\u2013112 (2004)"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-30500-2_6","volume-title":"Implementation and Application of Automata","author":"B. Borchardt","year":"2005","unstructured":"Borchardt, B.: Code selection by tree series transducers. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 57\u201367. Springer, Heidelberg (2005)"},{"key":"15_CR14","first-page":"523","volume-title":"Proc. 39th Annual Meeting Assoc. Comput. Ling.","author":"K. Yamada","year":"2001","unstructured":"Yamada, K., Knight, K.: A syntax-based statistical translation model. In: Proc. 39th Annual Meeting Assoc. Comput. Ling., pp. 523\u2013530. Morgan Kaufmann, San Francisco (2001)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Brown, P.F., Cocke, J., Della Pietra, S., Della Pietra, V.J., Jelinek, F., Mercer, R.L., Roossin, P.S.: A statistical approach to language translation. In: Proc. 12th Int. Conf. Comput. Ling., pp. 71\u201376 (1988)","DOI":"10.3115\/991635.991651"},{"key":"15_CR16","first-page":"263","volume":"19","author":"P.F. Brown","year":"1993","unstructured":"Brown, P.F., Della Pietra, S., Della Pietra, V.J., Mercer, R.L.: The mathematics of statistical machine translation: Parameter estimation. Comput. Linguist.\u00a019, 263\u2013311 (1993)","journal-title":"Comput. Linguist."},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00224-003-1072-z","volume":"36","author":"Z. F\u00fcl\u00f6p","year":"2003","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Tree series transformations that respect copying. Theory Comput. Systems\u00a036, 247\u2013293 (2003)","journal-title":"Theory Comput. Systems"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s002240000110","volume":"32","author":"S. Bozapalidis","year":"1999","unstructured":"Bozapalidis, S.: Equational elements in additive algebras. Theory Comput. Systems\u00a032, 1\u201333 (1999)","journal-title":"Theory Comput. Systems"},{"key":"15_CR19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-642-60207-8_13","volume-title":"Jewels Are Forever","author":"W. Kuich","year":"1999","unstructured":"Kuich, W.: Full abstract families of tree series I. In: Karhum\u00e4ki, J., Maurer, H.A., Paun, G., Rozenberg, G. (eds.) Jewels Are Forever, pp. 145\u2013156. Springer, Heidelberg (1999)"},{"key":"15_CR20","first-page":"219","volume":"8","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Kuich, W.: Formal tree series. J. Autom. Lang. Combin.\u00a08, 219\u2013285 (2003)","journal-title":"J. Autom. Lang. Combin."},{"key":"15_CR21","unstructured":"Borchardt, B.: The Theory of Recognizable Tree Series. PhD thesis, Technische Universit\u00e4t Dresden (2005)"},{"key":"15_CR22","unstructured":"Pech, C.: Kleene-Type Results for Weighted Tree-Automata. PhD thesis, Technische Universit\u00e4t Dresden (2003)"},{"key":"15_CR23","unstructured":"Engelfriet, J.: Tree automata and tree grammars. Technical Report DAIMI FN-10, Aarhus University (1975)"},{"key":"15_CR24","first-page":"135","volume":"14","author":"W. Kuich","year":"1999","unstructured":"Kuich, W.: Tree transducers and formal tree series. Acta Cybernet\u00a014, 135\u2013149 (1999)","journal-title":"Acta Cybernet"},{"key":"15_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-9333-5","volume-title":"Semirings and their Applications","author":"J.S. Golan","year":"1999","unstructured":"Golan, J.S.: Semirings and their Applications. Kluwer Academic, Dordrecht (1999)"},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1142\/S012905410500325X","volume":"16","author":"A. Maletti","year":"2005","unstructured":"Maletti, A.: Relating tree series transducers and weighted tree automata. Int. J. Found. Comput. Sci.\u00a016, 723\u2013741 (2005)","journal-title":"Int. J. Found. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:26:54Z","timestamp":1619494014000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11812128_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}