XSLT version 2.0 is turing-complete: a purely transformation based proof

Authors:
Ruhsan Onder;Zeki Bayram
Affiliations:
Department of Computer Engineering and Internet Technologies Research Center, Eastern Mediterranean University, Famagusta, Cyprus;Department of Computer Engineering and Internet Technologies Research Center, Eastern Mediterranean University, Famagusta, Cyprus
Venue:
CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata
Year:
2006

Citing 2
Cited 1

Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Theory of Computation

Theory of Computation

A learning algorithm for top-down XML transformations

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

XSLT version 2.0 has the full power of a Turing machine, i.e. it is “Turing-complete.” We show this is so by implementing a universal Turing machine emulator stylesheet in XSLT. We use only the constructs available in the official XSLT version 2.0 recommendation of the World Wide Web Consortium. Furthermore, we do not resort to string functions (which are also available in XSLT) but rather rely on the innate transformational capabilities of XSLT.