Composing stack-attributed tree transducers

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


Stack-attributed tree transducers extend attributed tree transducers with a pushdown stack device for attribute values, which make them strictly more powerful. This paper presents an algorithm for the composition of stack-attributed tree transducers with attributed tree transducers. The algorithm is an extension of the existing method to compose attributed tree transducers. It leads to some natural closure properties of the corresponding classes of tree transformations.

Original languageEnglish
Pages (from-to)1-38
Number of pages38
JournalTheory of Computing Systems
Issue number1
Publication statusPublished - 2009 Jan 1
Externally publishedYes


  • Attribute grammar
  • Deforestation
  • Descriptional composition
  • Event-driven model
  • XML stream transformation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Composing stack-attributed tree transducers'. Together they form a unique fingerprint.

Cite this