Proprietes de cloture d'une extension de transducteurs d'arbres deterministes

  • Eric Lilin
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 112)


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.


Nous Avons Tree Transducer Nous Allons Nous Pouvons Nous Obtenons 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    ARNOLD A. et DAUCHET M., "Théorie des magmoïdes" RAIRO 12 p 235–257 et RAIRO 13 p 135–154.Google Scholar
  2. [2]
    DAUCHET M., "Transductions de forêts — Bimorphismes de magmoïdes", Thèse d'Etat, Université de Lille (1977).Google Scholar
  3. [3]
    DONER J., "Tree acceptors and some of their applications", J. Comput System Sci. 4 (1970) p 406–451.Google Scholar
  4. [4]
    ENGELFRIET J., "Bottom up and top-down tree transformations — a comparison", Math System Theory 9 (1975) p 198–231.Google Scholar
  5. [5]
    ENGELFRIET J., "Top down tree transducers with regulan Look-ahead" Math System Theory 10 (1977) p 289–303.Google Scholar
  6. [6]
    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).Google Scholar
  7. [7]
    LILIN E., "S-transducteurs de forêts" (1978), communication au 3e CLAAP.Google Scholar
  8. [8]
    ROUNDS W.C., "Tree transducers and transformation", Ph D. Dissertation Stanford University (1968).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Eric Lilin

There are no affiliations available

Personalised recommendations