Word-into-Trees Transducers with bounded difference

  • Yves Andre
  • Francis Bossut
II CAAP CAAP-1: Rewriting and Automata
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1214)


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.


Input Tree Tree Automaton Input Word Tree Language Tree Transducer 
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.


  1. [1]
    B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. Proceedings of STACS 1992. LNCS 577, pp 161–171.Google Scholar
  2. [2]
    A.C. Caron. Structures et décision en réécriture. Ph. D. thesis. University of Lille 1. 1993.Google Scholar
  3. [3]
    A.C. Caron, J.L. Coquidé and M. Dauchet. Encompassment Properties and Automata with Constraints. Proceedings of RTA '93. LNCS 690, pp 328–341.Google Scholar
  4. [4]
    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.Google Scholar
  5. [5]
    J. Engelfriet. Bottom-up and top-down tree transformations: a comparison. Mathematical system theory. Vol 9. pp 198–231. 1975.CrossRefGoogle Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    C. Frougny and J. Sakarovitch. Synchronised rational relations of finite and infinite words. In Theoretical Computer Science. Nber 108, pp 45–82. 1993.CrossRefGoogle Scholar
  8. [8]
    G. Huet. Confluent reductions: Abstract properties and applications to term rewriting system. J.A.C.M. 27. pp 797–821. 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Yves Andre
    • 1
  • Francis Bossut
    • 1
  1. 1.L.I.F.L., U.R.A. 369 C.N.R.S.University of Lille 1Villeneuve d'Ascq CedexFrance

Personalised recommendations