An algebraic definition of attributed transformations
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.
KeywordsClosure Property Tree Automaton Deterministic Part Tree Transducer Unique Node
Unable to display preview. Download preview PDF.
- Arnold, A., Dauchet, M., Theorie des magmoides, Preliminary work to the authors' theses, Univ. de Lille, France, 1977.Google Scholar
- Dauchet, M., Transductions de forets, bimorphismes de magmoides, These, Univ. de Lille, France, 1977.Google Scholar
- 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.Google Scholar
- Chirica, L.M., Martin, D.F., An order-algebraic Definition of Knuthian Semantics, Math. Systems Theory, v. 13, 1979, pp. 1–27.Google Scholar
- Riis, H., Skyum, S., k-Visit attribute grammars, DAIMI PB-121, Aarhus University, Denmark, 1980.Google Scholar
- Fülöp, Z., Attribute grammars and attributed tree transducers, 15-th National Scientific Conference for Students, Budapest, Hungary, 1981.Google Scholar