Abstract
A general concept of attributed transformation is introduced. It is shown that the domain of attributed tree transformations is a regular tree language, and an alternative proof is given for the decidability of the K-visit property of deterministic attributed tree transducers. Finally some closure properties are investigated concerning the composition of attributed tree transformations.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Arnold, A., Dauchet, M., Theorie des magmoides, Preliminary work to the authors' theses, Univ. de Lille, France, 1977.
Dauchet, M., Transductions de forets, bimorphismes de magmoides, These, Univ. de Lille, France, 1977.
Wright, J.B., Thatcher, J.W., Wagner, E.G., Goguen, J.A., Rational algebraic theories and fixed-point solutions, 17-th IEEE Symposium on Foundations of Computing, Houston, 1976, pp. 147–158.
Chirica, L.M., Martin, D.F., An order-algebraic Definition of Knuthian Semantics, Math. Systems Theory, v. 13, 1979, pp. 1–27.
Riis, H., Skyum, S., k-Visit attribute grammars, DAIMI PB-121, Aarhus University, Denmark, 1980.
Fülöp, Z., Attribute grammars and attributed tree transducers, 15-th National Scientific Conference for Students, Budapest, Hungary, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bartha, M. (1981). An algebraic definition of attributed transformations. In: Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1981. Lecture Notes in Computer Science, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10854-8_5
Download citation
DOI: https://doi.org/10.1007/3-540-10854-8_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10854-2
Online ISBN: 978-3-540-38765-7
eBook Packages: Springer Book Archive