XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof

DOI10.1007/11812128_26MaRDI QIDQ5757225zbMATH OpenOpenAlexFDO

Authors Ruhsan Onder, Zeki Bayram

Publication date 6 September 2007

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11812128_26

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the tree-transformation power of XSLT
• A formal model for an expressive fragment of XSLT
• scientific article; zbMATH DE number 2080402
• scientific article; zbMATH DE number 3938596
• Equivalences and optimizations in an expressive XSLT subset

Cited in

(1)

• On the tree-transformation power of XSLT

This page was built for publication: XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757225)