{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:35Z","timestamp":1759637555814},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,10,26]],"date-time":"2006-10-26T00:00:00Z","timestamp":1161820800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2007,1]]},"DOI":"10.1007\/s00236-006-0026-8","type":"journal-article","created":{"date-parts":[[2006,10,25]],"date-time":"2006-10-25T13:45:44Z","timestamp":1161783944000},"page":"371-393","source":"Crossref","is-referenced-by-count":8,"title":["On the tree-transformation power of XSLT"],"prefix":"10.1007","volume":"43","author":[{"given":"Wim","family":"Janssen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandr","family":"Korlyukov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Van den Bussche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,26]]},"reference":[{"key":"26_CR1","unstructured":"XML path language (XPath) version 1.0. W3C Recommendation, November (1999)"},{"key":"26_CR2","unstructured":"XSL transformations (XSLT) version 1.0. W3C Recommendation, November (1999)"},{"key":"26_CR3","unstructured":"XSLT requirements version 2.0. W3C Working Draft, February (2001)"},{"key":"26_CR4","unstructured":"XML schema. W3C Recommendation, October (2004)"},{"key":"26_CR5","unstructured":"XML path language (XPath) version 2.0. W3C Working Draft, April (2005)"},{"key":"26_CR6","unstructured":"XQuery 1.0 and XPath 2.0 data model. W3C Working Draft, April (2005)"},{"key":"26_CR7","unstructured":"XQuery 1.0 and XPath 2.0 formal semantics. W3C Working Draft, June (2005)"},{"key":"26_CR8","unstructured":"XSL transformations (XSLT) version 2.0. W3C Working Draft, April (2005)"},{"key":"26_CR9","unstructured":"Bex, G.J., Maneth, S., Neven, F.: A formal model for an expressive fragment of XSLT. Informat. Syst. 27(1), 21\u201339 (2002)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Buneman, P., Grohe, M., Koch, C.: Path queries on compressed XML. In: Freytag, J.C., Lockemann, P.C., et\u00a0al. (eds.) Proceedings 29th International Conference on Very Large Data Bases, pp. 141\u2013152, Morgan Kaufmann (2003)","DOI":"10.1016\/B978-012722442-8\/50021-5"},{"key":"26_CR11","unstructured":"Dong, C., Bailey, J.: Static analysis of XSLT programs. In: Schewe, K.D., Williams, H.E., (eds.) Database Technologies\u2014Proceedings ADC 2004, pp. 151\u2013160 Australian Computer Society (2004)"},{"issue":"1","key":"26_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0022-0000(85)90066-2","volume":"31","author":"J. Engelfriet","year":"1985","unstructured":"Engelfriet J., Vogler H. (1985): Macro tree transducers. J. Comput. Syst. Sci. 31(1): 71\u2013146","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"26_CR13","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/776985.776988","volume":"32","author":"G. Gottlob","year":"2003","unstructured":"Gottlob G., Koch C., Pichler R. (2003): XPath processing in a nutshell. SIGMOD Rec. 32(2): 21\u201327","journal-title":"SIGMOD Rec."},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Hidders, J., Paredaens, J., Vercammen, R., et\u00a0al.: A light but formal introduction to XQuery. In: Bellahs\u00e8ne, Z., Milo, T., Rys, M., et\u00a0al. (eds.) Database and XML Technologies\u2014Proceedings XSym. Lecture Notes in Computer Science, vol. 3186, pp. 5\u201320. Springer, Berlin Heidelberg New York (2004)","DOI":"10.1007\/978-3-540-30081-6_2"},{"key":"26_CR15","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft J.E., Ullman J.E. (1979): Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, MA"},{"issue":"2","key":"26_CR16","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/767193.767195","volume":"3","author":"H. Hosoya","year":"2003","unstructured":"Hosoya H., Pierce B.C. (2003): XDuce: A statically typed XML processing language. ACM Trans. Internet Technol. 3(2): 117\u2013148","journal-title":"ACM Trans. Internet Technol."},{"key":"26_CR17","unstructured":"Kay, M.: SAXON: The XSLT and XQuery processor. http:\/\/saxon.sourceforge.net"},{"key":"26_CR18","unstructured":"Kay, M.: XSLT 2.0 Programmer\u2019s Reference. Wrox, 3rd ed (2004)"},{"key":"26_CR19","unstructured":"Kepser, S.: A simple proof for the turing-completeness of XSLT and XQuery. Presented at Extreme Markup Languages 2004. http:\/\/www.mulberrytech.com\/Extreme\/Proceedings\/"},{"key":"26_CR20","unstructured":"Kirchner, C., Qian, Z., Singh, P.K., Stuber, J.: Xemantics: a rewriting calculus-based semantics of XSLT@. LORIA Technical Report A01-R-386, Laboratoire Lorrain de Recherche en Informatique et ses Applications, Nancy (2001)"},{"key":"26_CR21","unstructured":"Korlyukov, A.: Turing machine for XSLT. http:\/\/www.refal.net\/~korlukov\/tm\/index.htm"},{"key":"26_CR22","unstructured":"Lyons, B.: Universal turing machines in XSLT. http:\/\/www.unidex.com\/turing\/utm.htm"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Maneth, S.: The complexity of compositions of deterministic tree transducers. In: Agrawal, M., Seth, A., (eds.) FST TCS 2002 Proceedings, Lecture Notes in Computer Science, vol. 2556, pp. 265\u2013276. Springer, Berlin Heidelberg New York (2002)","DOI":"10.1007\/3-540-36206-1_24"},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Maneth, S., Berlea, A., Perst, T., Seidl, H.: XML type checking with macro tree transducers. In: Proceedings 24th ACM Symposium on Principles of Database Systems, pp. 283\u2013294. ACM Press (2005)","DOI":"10.1145\/1065167.1065203"},{"issue":"1","key":"26_CR25","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/S0022-0000(02)00030-2","volume":"66","author":"T. Milo","year":"2003","unstructured":"Milo T., Suciu D., Vianu V. (2003): Typechecking for XML transformers. J. Comput. Syst. Sci. 66(1): 66\u201397","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR26","unstructured":"Novatchev, D.: FXSL: The functional programming library for XSLT. http:\/\/fxsl.sourceforge.net"},{"key":"26_CR27","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou C.H. (1994): Computational Complexity. Addison-Wesley, Reading MA"},{"issue":"2","key":"26_CR28","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","volume":"16","author":"M.S. Paterson","year":"1978","unstructured":"Paterson M.S., Wegman M.N. (1978): Linear unification. J. Comput. Syst. Sci. 16(2): 158\u2013167","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"26_CR29","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.ipl.2003.05.001","volume":"89","author":"T. Perst","year":"2004","unstructured":"Perst T., Seidl H. (2004): Macro forest transducers. Informat. Process. Lett. 89(3): 141\u2013149","journal-title":"Informat. Process. Lett."},{"issue":"1","key":"26_CR30","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","volume":"20","author":"B.K. Rosen","year":"1973","unstructured":"Rosen B.K. (1973): Tree-manipulating systems and Church-Rosser theorems. J. ACM 20(1): 160\u2013187","journal-title":"J. ACM"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"Sim\u00e9on, J., Wadler, P.: The essence of XML. In: Proceedings 30th ACM Symposium on Principles of Programming Languages, p. 1\u201313. ACM Press (2003)","DOI":"10.1145\/604131.604132"},{"key":"26_CR32","unstructured":"Terese. (2003): Term Rewriting Systems. Cambridge University Press, Cambridge"},{"issue":"6","key":"26_CR33","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s00236-005-0004-6","volume":"42","author":"A. Trombetta","year":"2006","unstructured":"Trombetta A., Montesi D. (2006): Equivalences and optimizations in an expressive XSLT subset. Acta Informat. 42(6): 515\u2013539","journal-title":"Acta Informat."},{"issue":"2","key":"26_CR34","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1162\/10996620052104302","volume":"2","author":"P. Wadler","year":"2000","unstructured":"Wadler P. (2000): A formal semantics of patterns in XSLT and XPath. Markup Langu. Theor. Pract. 2(2): 183\u2013202","journal-title":"Markup Langu. Theor. Pract."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0026-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-006-0026-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0026-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:53Z","timestamp":1558705313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-006-0026-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,26]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["26"],"URL":"https:\/\/doi.org\/10.1007\/s00236-006-0026-8","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,26]]}}}