XSLT version 2.0 is Turing-complete: A purely transformation based proof

Simple item page
dc.contributor.authorOnder, Ruhsan
dc.contributor.authorBayram, Zeki
dc.date.accessioned2026-02-06T18:16:39Z
dc.date.issued2006
dc.departmentDoğu Akdeniz Üniversitesi
dc.description11th International Conference on Implementation and Application of Automata -- AUG 21-23, 2006 -- Natl Taiwan Univ, Taipei, TAIWAN
dc.description.abstractXSLT 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.
dc.identifier.endpage276
dc.identifier.isbn3-540-37213-X
dc.identifier.issn0302-9743
dc.identifier.scopus2-s2.0-33749387412
dc.identifier.scopusqualityQ3
dc.identifier.startpage275
dc.identifier.urihttps://hdl.handle.net/11129/8583
dc.identifier.volume4094
dc.identifier.wosWOS:000240312700026
dc.identifier.wosqualityN/A
dc.indekslendigikaynakWeb of Science
dc.indekslendigikaynakScopus
dc.language.isoen
dc.publisherSpringer-Verlag Berlin
dc.relation.ispartofImplementation and Application of Automata
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccess
dc.snmzKA_WoS_20260204
dc.titleXSLT version 2.0 is Turing-complete: A purely transformation based proof
dc.typeConference Object

Files

Collections

WoS Indexed Publications Collection
Scopus İndeksli Yayınlar Koleksiyonu