Skip to main content
SpringerLink
Log in
Book cover

Colloquium on Trees in Algebra and Programming

CAAP 1983: CAAP'83 pp 167–178Cite as

Continuite des transducteurs d'etats finis d'arbres

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((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.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  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. 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. 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. BLOOM S. et TINDELL R., "Compatible orderings on the metric theory of trees". SIAM Jour. Comput. vol. 9, 4 (1980), pp. 683–691.

    Article  Google Scholar 

  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. COMYN G. et DAUCHET M., "Approximations of inginitary objets". ICALP 82, Aahrus, Dannemark, (1982).

    Google Scholar 

  7. COMYN G. et DAUCHET M., "Ordered on metric properties of semantic domains". Journées Franco-américaines, Fontainebleau (1982).

    Google Scholar 

  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. COURCELLE B. et FRANCHI-ZANNETTACHI P., "Attribute grammars and recursive program schemes I". Theoritical Computer Science 17 (1982), pp. 163–191.

    Article  Google Scholar 

  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. DAUCHET M., "Transductions de goréts. Bimorphismes de magmoïdes". Thèse d'Etat, Université de Lille I, (1977).

    Google Scholar 

  12. ENGELFRIET J., "Bottom up and top down tree transgormations. A comparison". Math. System Theory 9 (1975), pp. 198–231.

    Article  Google Scholar 

  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. ENGELFRIET J., "Tree Transducers and Syntax-Directed Semantics". Communication au 7e CAAP, Université de Lille I, (1982).

    Google Scholar 

  15. GUESSARIAN I., "About stack tree Automata". Communication au 7e CAAP, Université de Lille I, (1982).

    Google Scholar 

  16. Lilin E., "Transducteurs sinis d'arbres et tests d'égalité". RAIRO, vol. 15 no 3, (1981), pp. 213–232.

    Google Scholar 

  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. PENKOV B. et SENDOV B., "Hausdorffsche Merick und Approximationen". Numerische Mathematik, 9 (1966), pp. 214–226.

    Google Scholar 

  19. ROUNDS W.C., "Mapping and Grammars on Trees". Math. System Theory, vol. 4, (1970), pp. 257–287.

    Article  Google Scholar 

  20. THATCHER J.W., "Tree automata: An informal survey". Currents in Theory of Comp., Aho (Ed.), Prentice Hall, London (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universite Des Sciences Et Techniques De Lille I, 59655, Villeneuve D'Ascq Cedex

    M. F. Claerebout & E. Lilin

Authors
  1. M. F. Claerebout
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. E. Lilin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Marco Protasi

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Claerebout, M.F., Lilin, E. (1983). Continuite des transducteurs d'etats finis d'arbres. In: Ausiello, G., Protasi, M. (eds) CAAP'83. CAAP 1983. Lecture Notes in Computer Science, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-12727-5_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-12727-5_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12727-7

  • Online ISBN: 978-3-540-38714-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation