Composing Stack-Attributed Tree Transducers

Authors:
Keisuke Nakano
Affiliations:
The University of Electro-Communications, 1-5-1, Chofugaoka, Chofu-shi, 182-8585, Tokyo, Japan
Venue:
Theory of Computing Systems
Year:
2008

Citing 0
Cited 1

Categorical descriptional composition

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems

Quantified Score

Hi-index	0.04

Visualization

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.