Advertisement

Continuite des transducteurs d'etats finis d'arbres

  • M. F. Claerebout
  • E. Lilin
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 159)

Resume

Nous étudions la continuité de certaines classes de transducteurs descendants d'états finis d'arbres.Nous montrons que dans le cas déterministe les transducteurs quasi real time et quasi complètement spécifiés caractérisent les transducteurs continus, ce qui n'est plus vrai dans le cas non déterministe.

Keywords

Tree Automaton Tree Transducer Attribute Grammar Quasi Real Time Nous Montrons 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. [1]
    ARNOLD A. et DAUCHET M., "Thansductions de Gonéts neconnaissables monadiques. Fonéts conéguliènes". RAIRO, vol. 10, (1976), pp. 5–23.Google Scholar
  2. [2]
    ARNOLD A. et DAUCHET M., "Théonie des magmoïdes". RAIRO, vol. 12 no 3, (1978), pp. 235–257, et vol. 13 no 2, (1979), pp. 135–154.Google Scholar
  3. [3]
    ARNOLD A. et DAUCHET M., "The metric space of infinite trees; Algebraic and topological properties". Annales Societatis Mathematicae Polonae, Series IV: Fundamenta Informaticae II-4 (1980), pp. 445–476.Google Scholar
  4. [4]
    BLOOM S. et TINDELL R., "Compatible orderings on the metric theory of trees". SIAM Jour. Comput. vol. 9, 4 (1980), pp. 683–691.CrossRefGoogle Scholar
  5. [5]
    CLAEREBOUT M.F. et LILIN E., "Continuité des transducteurs d'états sinis d'arbres". Publication IT-53 du Laboratoire de Calcul de l'Université de Lille (1983).Google Scholar
  6. [6]
    COMYN G. et DAUCHET M., "Approximations of inginitary objets". ICALP 82, Aahrus, Dannemark, (1982).Google Scholar
  7. [7]
    COMYN G. et DAUCHET M., "Ordered on metric properties of semantic domains". Journées Franco-américaines, Fontainebleau (1982).Google Scholar
  8. [8]
    COURCELLE B., "Attribute grammars: Theory and applications". Proc. Coll. on Formalization of Programming Concepts, Lecture Notes on Computer Science 107, (1981), pp. 75–95.Google Scholar
  9. [9]
    COURCELLE B. et FRANCHI-ZANNETTACHI P., "Attribute grammars and recursive program schemes I". Theoritical Computer Science 17 (1982), pp. 163–191.CrossRefGoogle Scholar
  10. [10]
    DAMM W. et BILSTEIN J., "Top down tree transducers gon inginite trees I". Lecture Notes in Computer Science 112, CAAP 81, Trees in Algebra and Programming 6e Colloquium Genova.Google Scholar
  11. [11]
    DAUCHET M., "Transductions de goréts. Bimorphismes de magmoïdes". Thèse d'Etat, Université de Lille I, (1977).Google Scholar
  12. [12]
    ENGELFRIET J., "Bottom up and top down tree transgormations. A comparison". Math. System Theory 9 (1975), pp. 198–231.CrossRefGoogle Scholar
  13. [13]
    ENGELFRIET J., "Some open questions and recent resuets on tree transducers and tree languages". Dans Formal Languages: Perspectives and open problems, Academic Press, London (1980), pp. 241–286.Google Scholar
  14. [14]
    ENGELFRIET J., "Tree Transducers and Syntax-Directed Semantics". Communication au 7e CAAP, Université de Lille I, (1982).Google Scholar
  15. [15]
    GUESSARIAN I., "About stack tree Automata". Communication au 7e CAAP, Université de Lille I, (1982).Google Scholar
  16. [16]
    Lilin E., "Transducteurs sinis d'arbres et tests d'égalité". RAIRO, vol. 15 no 3, (1981), pp. 213–232.Google Scholar
  17. [17]
    NIVAT M., "Inlinite words, inlinite trees, inlinite computation". Foundation of Computer Science III, J.W. de Bakker, J. Van Leeuwen (Eds), Mathematical Center Tracts 108, Part II (1979), pp. 1–52.Google Scholar
  18. [18]
    PENKOV B. et SENDOV B., "Hausdorffsche Merick und Approximationen". Numerische Mathematik, 9 (1966), pp. 214–226.Google Scholar
  19. [19]
    ROUNDS W.C., "Mapping and Grammars on Trees". Math. System Theory, vol. 4, (1970), pp. 257–287.CrossRefGoogle Scholar
  20. [20]
    THATCHER J.W., "Tree automata: An informal survey". Currents in Theory of Comp., Aho (Ed.), Prentice Hall, London (1973).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • M. F. Claerebout
    • 1
  • E. Lilin
    • 1
  1. 1.Universite Des Sciences Et Techniques De Lille IVilleneuve D'Ascq Cedex

Personalised recommendations