{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:06:23Z","timestamp":1725505583452},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784975"},{"type":"electronic","value":"9783540784999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_10","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:02:25Z","timestamp":1207090945000},"page":"127-141","source":"Crossref","is-referenced-by-count":1,"title":["Classes of Tree Homomorphisms with Decidable Preservation of Regularity"],"prefix":"10.1007","author":[{"given":"Guillem","family":"Godoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Maneth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sophie","family":"Tison","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0019-9958(71)90706-6","volume":"19","author":"A.V. Aho","year":"1971","unstructured":"Aho, A.V., Ullman, J.D.: Translations on a context-free grammar. Information and Control\u00a019, 439\u2013475 (1971)","journal-title":"Information and Control"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/3-540-49019-1_11","volume-title":"Foundations of Software Science and Computation Structures","author":"B. Bogaert","year":"1999","unstructured":"Bogaert, B., Seynhaeve, F., Tison, S.: The recognizability problem for tree automata with comparison between brothers. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.\u00a01578, pp. 150\u2013164. Springer, Heidelberg (1999)"},{"key":"10_CR3","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/inco.1994.1056","volume":"112","author":"H. Comon","year":"1994","unstructured":"Comon, H., Delor, C.: Equational formulae with membership constraints. Inf. Comput.\u00a0112, 167\u2013216 (1994)","journal-title":"Inf. Comput."},{"key":"10_CR5","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 \u2014 A comparison. Math. Systems Theory\u00a09, 198\u2013231 (1975)","journal-title":"Math. Systems Theory"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(94)90241-0","volume":"134","author":"Z. F\u00fcl\u00f6p","year":"1994","unstructured":"F\u00fcl\u00f6p, Z.: Undecidable properties of deterministic top-down tree transducers. Theoret. Comput. Sci.\u00a0134, 311\u2013328 (1994)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR7","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, ch.\u00a01, Springer, Heidelberg (1997)"},{"key":"10_CR8","volume-title":"Introduction to automata theory, languages, and computation","author":"J.W. Hopcroft","year":"1979","unstructured":"Hopcroft, J.W., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison-Wesley, Reading (1979)"},{"key":"10_CR9","unstructured":"Hosoya, H.: Foundations of XML processing (2002), http:\/\/arbre.is.s.u-tokyo.ac.jp\/~hahosoya\/xmlbook\/xmlbook.pdf"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Kucherov, G., Rusinowitch, M.: Patterns in words versus patterns in trees: A brief survey and new results. In: Ershov Memorial Conference, pp. 283\u2013296 (1999)","DOI":"10.1007\/3-540-46562-6_25"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1995.1054","volume":"118","author":"G. Kucherov","year":"1995","unstructured":"Kucherov, G., Tajine, M.: Decidability of regularity and related properties of ground normal form languages. Inf. Comput.\u00a0118, 91\u2013100 (1995)","journal-title":"Inf. Comput."},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF00243794","volume":"3","author":"J.-L. Lassez","year":"1987","unstructured":"Lassez, J.-L., Marriott, K.: Explicit representation of terms defined by counter examples. J. Autom. Reasoning\u00a03, 301\u2013317 (1987)","journal-title":"J. Autom. Reasoning"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.tcs.2004.10.035","volume":"336","author":"W. Martens","year":"2005","unstructured":"Martens, W., Neven, F.: On the complexity of typechecking top-down xml transformations. Theor. Comput. Sci.\u00a0336, 153\u2013180 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1145\/1111627.1111631","volume":"5","author":"M. Murata","year":"2005","unstructured":"Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of xml schema languages using formal language theory. ACM Trans. Internet Techn.\u00a05(4), 660\u2013704 (2005)","journal-title":"ACM Trans. Internet Techn."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/507338.507360","volume":"31","author":"D. Suciu","year":"2002","unstructured":"Suciu, D.: The XML typechecking problem. SIGMOD Record\u00a031, 89\u201396 (2002)","journal-title":"SIGMOD Record"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:11:27Z","timestamp":1619521887000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_10","relation":{},"subject":[]}}