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

  • Ruhsan Onder
  • Zeki Bayram
Conference paper

DOI: 10.1007/11812128_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4094)
Cite this paper as:
Onder R., Bayram Z. (2006) XSLT Version 2.0 Is Turing-Complete: A Purely Transformation Based Proof. In: Ibarra O.H., Yen HC. (eds) Implementation and Application of Automata. CIAA 2006. Lecture Notes in Computer Science, vol 4094. Springer, Berlin, Heidelberg

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ruhsan Onder
    • 1
  • Zeki Bayram
    • 1
  1. 1.Department of Computer Engineering and Internet Technologies Research CenterEastern Mediterranean UniversityFamagustaCyprus

Personalised recommendations