Abstract
Non-deleting Word-into-Trees Transducers with bounded difference are investigated in this paper. Informally, these transducers which produce trees from words have the property that the difference of height of any couple of trees (the input tree being a word) is bounded. We establish the fact that the tree transformations induced by such transducers have some good closure properties.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. Proceedings of STACS 1992. LNCS 577, pp 161–171.
A.C. Caron. Structures et décision en réécriture. Ph. D. thesis. University of Lille 1. 1993.
A.C. Caron, J.L. Coquidé and M. Dauchet. Encompassment Properties and Automata with Constraints. Proceedings of RTA '93. LNCS 690, pp 328–341.
C.C. Elgot and J.E. Mezei. On relations defined by generalized finite automata. In IBM J. Res. Develop. Nber 9, pp 47–68, 1965.
J. Engelfriet. Bottom-up and top-down tree transformations: a comparison. Mathematical system theory. Vol 9. pp 198–231. 1975.
J. Engelfriet. Some open questions and recent results on tree transducers and tree languages. In Formal language theory ed. by R. V. Book, Academic press 1980, pp 241–286.
C. Frougny and J. Sakarovitch. Synchronised rational relations of finite and infinite words. In Theoretical Computer Science. Nber 108, pp 45–82. 1993.
G. Huet. Confluent reductions: Abstract properties and applications to term rewriting system. J.A.C.M. 27. pp 797–821. 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andre, Y., Bossut, F. (1997). Word-into-Trees Transducers with bounded difference. In: Bidoit, M., Dauchet, M. (eds) TAPSOFT '97: Theory and Practice of Software Development. CAAP 1997. Lecture Notes in Computer Science, vol 1214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030595
Download citation
DOI: https://doi.org/10.1007/BFb0030595
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62781-4
Online ISBN: 978-3-540-68517-3
eBook Packages: Springer Book Archive