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.
Cite
CITATION STYLE
Bartha, M. (1981). An algebraic definition of attributed transformations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 117 LNCS, pp. 51–60). Springer Verlag. https://doi.org/10.1007/3-540-10854-8_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
