Skip to main content
SpringerLink
Log in

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

  • Conference paper
Implementation and Application of Automata (CIAA 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4094))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Onder, R., Bayram, Z.: Interpreting imperative programming languages in XSLT. In: Proceedings of the Ninth IASTED International conference on Internet and Multimedia Systems and Applications (EuroIMSA 2005), IASTED, pp. 131–136 (2005)

    Google Scholar 

  2. Hopcroft, J., Motwani, R., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  3. Brainerd, W., Landweber, L.: Theory of Computation. Wiley, Chichester (1974)

    Google Scholar 

  4. Kay, M. (ed.): XSL transformations (XSLT) version 2.0 of W3C working draft (2005), Available at: http://www.w3.org/TR/xslt20

  5. Onder, R., Bayram, Z.: Universal Turing Machine Emulator Stylesheet UTMES (2006), Available at: http://itrc.emu.edu.tr

  6. Kepser, S.: A simple proof for the Turing-completeness of XSLT and XQuery. In: Proceedings of the Extreme Markup Languages, Montreal, Quebec (2004)

    Google Scholar 

  7. Lyons, B.: Universal Turing machine in XSLT (2001), Available at: http://www.unidex.com/turing/utm.htm

  8. Korlyukov, A.: Turing machine (2001), Available at: http://www.refal.net/~korlukov/tm/

  9. Clark, J.: XT: an XSLT processor in Java (2002), Available at: http://www.blnz.com/xt/index.html

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Internet Technologies Research Center, Eastern Mediterranean University, Famagusta, Cyprus

    Ruhsan Onder & Zeki Bayram

Authors
  1. Ruhsan Onder
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zeki Bayram
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara

    Oscar H. Ibarra

  2. Dept. of Computer Science, Kainan University, Taoyuan, Taiwan, R.O.C.

    Hsu-Chun Yen

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/11812128_26

Download citation

  • DOI: https://doi.org/10.1007/11812128_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37213-4

  • Online ISBN: 978-3-540-37214-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation