Chapter

Implementation and Application of Automata

Volume 4094 of the series Lecture Notes in Computer Science pp 275-276

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

  • Ruhsan OnderAffiliated withLancaster UniversityDepartment of Computer Engineering and Internet Technologies Research Center, Eastern Mediterranean University
  • , Zeki BayramAffiliated withLancaster UniversityDepartment of Computer Engineering and Internet Technologies Research Center, Eastern Mediterranean University

* Final gross prices may vary according to local VAT.

Get Access

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.