XSLT version 2.0 is Turing-complete: A purely transformation based proof
Loading...
Date
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer-Verlag Berlin
Access Rights
info:eu-repo/semantics/closedAccess
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.
Description
11th International Conference on Implementation and Application of Automata -- AUG 21-23, 2006 -- Natl Taiwan Univ, Taipei, TAIWAN
Keywords
Journal or Series
Implementation and Application of Automata
WoS Q Value
Scopus Q Value
Volume
4094
