Abstract
We study closure properties of an extended class of deterministic finite state tree transducers. We shall show the closure under composition for certain sub classes. We compare the different classes introduced.
Preview
Unable to display preview. Download preview PDF.
References
ARNOLD A. et DAUCHET M., "Théorie des magmoïdes" RAIRO 12 p 235–257 et RAIRO 13 p 135–154.
DAUCHET M., "Transductions de forêts — Bimorphismes de magmoïdes", Thèse d'Etat, Université de Lille (1977).
DONER J., "Tree acceptors and some of their applications", J. Comput System Sci. 4 (1970) p 406–451.
ENGELFRIET J., "Bottom up and top-down tree transformations — a comparison", Math System Theory 9 (1975) p 198–231.
ENGELFRIET J., "Top down tree transducers with regulan Look-ahead" Math System Theory 10 (1977) p 289–303.
LILIN E., "Une généralisation des transducteurs d'états finis d'arbres: les S-transducteurs" Thèse de 3ème cycle, Université de Lille (1978).
LILIN E., "S-transducteurs de forêts" (1978), communication au 3e CLAAP.
ROUNDS W.C., "Tree transducers and transformation", Ph D. Dissertation Stanford University (1968).
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lilin, E. (1981). Proprietes de cloture d'une extension de transducteurs d'arbres deterministes. In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_69
Download citation
DOI: https://doi.org/10.1007/3-540-10828-9_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10828-3
Online ISBN: 978-3-540-38716-9
eBook Packages: Springer Book Archive