Composing stack-attributed tree transducers

Keisuke Nakano

doi:10.1007/s00224-008-9125-y

Composing stack-attributed tree transducers

Keisuke Nakano

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	1-38
Number of pages	38
Journal	Theory of Computing Systems
Volume	44
Issue number	1
DOIs	https://doi.org/10.1007/s00224-008-9125-y
Publication status	Published - 2009 Jan 1
Externally published	Yes

Keywords

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

ASJC Scopus subject areas

Theoretical Computer Science
Computational Theory and Mathematics

Access to Document

10.1007/s00224-008-9125-y

Cite this

@article{c882e91fc04347da8541f10d61a339a4,

title = "Composing stack-attributed tree transducers",

abstract = "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.",

keywords = "Attribute grammar, Deforestation, Descriptional composition, Event-driven model, XML stream transformation",

author = "Keisuke Nakano",

year = "2009",

month = jan,

day = "1",

doi = "10.1007/s00224-008-9125-y",

language = "English",

volume = "44",

pages = "1--38",

journal = "Theory of Computing Systems",

issn = "1432-4350",

publisher = "Springer New York",

number = "1",

}

TY - JOUR

T1 - Composing stack-attributed tree transducers

AU - Nakano, Keisuke

PY - 2009/1/1

Y1 - 2009/1/1

N2 - 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.

AB - 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.

KW - Attribute grammar

KW - Deforestation

KW - Descriptional composition

KW - Event-driven model

KW - XML stream transformation

UR - http://www.scopus.com/inward/record.url?scp=84894275810&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84894275810&partnerID=8YFLogxK

U2 - 10.1007/s00224-008-9125-y

DO - 10.1007/s00224-008-9125-y

M3 - Article

AN - SCOPUS:84894275810

VL - 44

SP - 1

EP - 38

JO - Theory of Computing Systems

JF - Theory of Computing Systems

SN - 1432-4350

IS - 1

ER -

Composing stack-attributed tree transducers

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this