{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:12:33Z","timestamp":1742382753850},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003236"},{"type":"electronic","value":"9783540362852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36285-1_5","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T15:21:32Z","timestamp":1192893692000},"page":"64-78","source":"Crossref","is-referenced-by-count":25,"title":["Typechecking Top-Down Uniform Unranked Tree Transducers"],"prefix":"10.1007","author":[{"given":"Wim","family":"Martens","sequence":"first","affiliation":[]},{"given":"Frank","family":"Neven","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,16]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. Typechecking XML views of relational databases. In Proc. 16th IEEE Symposium on Logic in Computer Science (LICS 2001), pages 421\u2013130, 2001.","DOI":"10.1109\/LICS.2001.932517"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. XML with data values: Typechecking revisited. In Proc. 20th Symposium on Principles of Database Systems (PODS 2001), pages 560\u2013572, 2001.","DOI":"10.1145\/375551.375570"},{"issue":"1","key":"5_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0306-4379(01)00033-3","volume":"27","author":"G. J. Bex","year":"2002","unstructured":"G. J. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT. Information Systems, 27(1):21\u201339, 2002.","journal-title":"Information Systems"},{"key":"5_CR4","unstructured":"A. Br\u00fcggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, april 3, 2001. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/s007780050084","volume":"9","author":"P. Buneman","year":"2000","unstructured":"P. Buneman, M. Fernandez, and D. Suciu. UnQl: a query language and algebra for semistructured data based on structural recursion. The VLDB Journal, 9(1):76\u2013110, 2000.","journal-title":"The VLDB Journal"},{"key":"5_CR6","unstructured":"James Clark. XSL transformations version 1.0. http:\/\/www.w3.org\/TR\/WD-xslt , august 1999."},{"key":"5_CR7","unstructured":"World Wide Web Consortium. XML Schema. http:\/\/www.w3.org\/XML\/Schema ."},{"issue":"3","key":"5_CR8","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(74)80046-2","volume":"9","author":"S. A. Cook","year":"1974","unstructured":"S. A. Cook. An observation on time-storage trade-off. Journal of Computer and System Sciences, 9(3):308\u2013316, 1974.","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"J. Engelfriet and H. Vogler. Macro tree transducers. Journal of Computer and System Sciences, 1985.","DOI":"10.1016\/0022-0000(85)90066-2"},{"key":"5_CR10","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 1, pages 1\u201368. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_1"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0213010","volume":"13","author":"R. E. Ladner","year":"1984","unstructured":"R. E. Ladner, R. J. Lipton, and L. J. Stockmeyer. Alternating pushdown and stack automata. SIAM Journal on Computing, 13(1):135\u2013155, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"5_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/3-540-44543-9_6","volume-title":"Research Issues in Structured and Semistructured Database Programming (DBPL\u201999)","author":"S. Maneth","year":"2000","unstructured":"S. Maneth and F. Neven. Structured document transformations based on XSL. In R. Connor and A. Mendelzon, editors, Research Issues in Structured and Semistructured Database Programming (DBPL\u201999), volume 1949 of Lecture Notes in Computer Science, pages 79\u201396. Springer, 2000."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"T. Milo and D. Suciu. Type inference for queries on semistructured data. In Proceedings of the Eighteenth ACM Symposium on Principles of Database Systems, pages 215\u2013226. ACM Press, 1999.","DOI":"10.1145\/303976.303998"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"T. Milo, D. Suciu, and V. Vianu. Type checking for XML transformers. In Proceedings of the Nineteenth ACM Symposium on Principles of Database Systems, pages 11\u201322. ACM Press, 2000.","DOI":"10.1145\/335168.335171"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3), 2002.","DOI":"10.1145\/601858.601869"},{"key":"5_CR17","unstructured":"F. Neven and T. Schwentick. XML schemas without order. Unpublished manuscript, 1999."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1016\/S0304-3975(01)00301-2","volume":"275","author":"F. Neven","year":"2002","unstructured":"F. Neven and T. Schwentick. Query automata on finite trees. Theoretical Computer Science, 275:633\u2013674, 2002.","journal-title":"Theoretical Computer Science"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proc. 20th Symposium on Principles of Database Systems (PODS 2001), pages 35\u201346. ACM Press, 2001.","DOI":"10.1145\/335168.335173"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1137\/0219027","volume":"19","author":"H. Seidl","year":"1990","unstructured":"H. Seidl. Deciding equivalence of finite tree automata. SIAM Journal on Computing, 19(3):424\u2013437, 1990.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(94)00130-8","volume":"52","author":"H. Seidl","year":"1994","unstructured":"H. Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52(2):57\u201360, 1994.","journal-title":"Information Processing Letters"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time: Preliminary report. In Conference Record of Fifth Annual ACM Symposium on Theory of Computing, pages 1\u20139, Austin, Texas, 30 April\u20132 May 1973.","DOI":"10.1145\/800125.804029"},{"key":"5_CR23","unstructured":"D. Suciu. Typechecking for semistructured data. In Proceedings of the 8th Workshop on Data Bases and Programming Languages (DBPL 2001), 2001."},{"issue":"1","key":"5_CR24","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1145\/507338.507360","volume":"31","author":"D. Suciu","year":"2002","unstructured":"D. Suciu. The XML typechecking problem. SIGMOD Record, 31(1):89\u201396, 2002.","journal-title":"SIGMOD Record"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"A. Tozawa. Towards static type checking for XSLT. In Proceedings of ACM Symposium on Document Engineering, 2001.","DOI":"10.1145\/502187.502191"},{"key":"5_CR26","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(89)90205-6","volume":"30","author":"M. Y. Vardi","year":"1989","unstructured":"M. Y. Vardi. A note on the reduction of two-way automata to one-way automata. Information Processing Letters, 30:261\u2013264, March 1989.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Database Theory \u2014 ICDT 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36285-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T13:05:29Z","timestamp":1684069529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36285-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,16]]},"ISBN":["9783540003236","9783540362852"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-36285-1_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002,12,16]]}}}