Skip to main content
SpringerLink
Log in

Sur l'inversion des morphismes d'arbres

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1978)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 62))

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Références

  1. A. ARNOLD et M. DAUCHET, "Un théorème de duplication pour les forêts algébriques". J. Comput. System Sci. 13 (1976) 223–244.

    Google Scholar 

  2. A. ARNOLD et M. DAUCHET, "Transductions de forêts reconnaissables monadiques. Forêts corégulières". R.A.T.R.O. Informatique théorique 10 (1976) 5–28.

    Google Scholar 

  3. A. ARNOLD et M. DAUCHET, "Transductions inversibles de forêts". Thèse 3o cycle M. DAUCHET, Université de Lille I (1975).

    Google Scholar 

  4. A. ARNOLD et M. DAUCHET, "Bitransductions de forêts" 3rd Automata Languages and Programming, Edinburg (1976) 74–86.

    Google Scholar 

  5. A. ARNOLD et M. DAUCHET, "Une équivalence décidable sur les forêts régulières". A paraître dans Math. Systems Theory.

    Google Scholar 

  6. A. ARNOLD et M. DAUCHET, "Un théorème de Chomsky-Schutzenberger pour les forêts algébriques". A paraître dans Calcolo.

    Google Scholar 

  7. A. ARNOLD et M. DAUCHET, "Forêts algébriques et homomorphismes inverses". A paraître dans "Information and Control".

    Google Scholar 

  8. A. ARNOLD et M. DAUCHET, "Théorie des Magmoïdes". Publication du Laboratoire de Calcul de l'Université de Lille I (1977).

    Google Scholar 

  9. A. ARNOLD et M. DAUCHET, "Morphismes et bimorphismes d'arbres". A paraître dans Theoretical Computer Sciences.

    Google Scholar 

  10. A. ARNOLD, M. DAUCHET et G. JACOB (éditeurs), "1er colloque sur les arbres en algèbre et en programmation". Lille I, (1976).

    Google Scholar 

  11. A. ARNOLD, M. DAUCHET et G. JACOB (éditeurs), "2ème colloque sur les arbres en algèbre et en programmation". Lille I, (1977).

    Google Scholar 

  12. A. ARNOLD, "Systèmes d'équations dans le magmoïde. Ensembles rationnels et algébriques d'arbres". Thèse de Doctorat d'Etat, Lille I (1977).

    Google Scholar 

  13. J.M. AUTEBERT et J. BEAUQUIER, "Une caractérisation des générateurs standard", R.A.I.R.O. Informatique théorique (1974) 63–83.

    Google Scholar 

  14. B.S. BAKER, "Tree-transductions and families of tree-languages". 5th A.C.M. Proc. on Theory of Computing (1973) 200–206.

    Google Scholar 

  15. L. BOASSON, "On the largest (full) sub-AFL of the context-free languages". Math. Foundations of Computer Science (1975), 194–198.

    Google Scholar 

  16. L. BOASSON et M. NIVAT, "Sur diverses familles de langages fermées par transduction rationnelle". Acta Informatica, 2 (1973) 180–188.

    Google Scholar 

  17. W.S. BRAINERD, "Tree-generating regular systems". Inf. and Control 14 (1969) 217–231.

    Article  Google Scholar 

  18. M. DAUCHET, "Transductions de forêts. Bimorphismes de magmoïdes". Thèse de Doctorat d'Etat, Lille I (1977).

    Google Scholar 

  19. J. ENGELFRIET, "Bottom-up and top-down tree transformations. A comparison". Math. System Theory 9 (1975) 198–231.

    Article  Google Scholar 

  20. M.J. FISCHER, "Grammars with macro-like productions". 9th IEEE Symp. on switching and automata theory (1968) 131–142.

    Google Scholar 

  21. S. GINSBURG et S. GREIBACH, "Studies in abstract families of languages". Memoirs of the Amer. Math. Soc. 113 (1966) 285–296.

    Google Scholar 

  22. S. GINSBURG et S. GREIBACH, "Principal AFL" Journ. of Computer and System Sciences 4 (1970) 308–338.

    Google Scholar 

  23. M. LATTEUX, "Cônes rationnels commutativement clos". R.A.I.R.O. Informatique théorique 11–1 (1977) 29–51.

    Google Scholar 

  24. M. NIVAT, "Transductions des langages de Chomsky". Annales de l'Institut Fourier de Grenoble 18 (1968) 339–456.

    Google Scholar 

  25. M. NIVAT, "On the interpretation of recursive program schemas". Rapport IRIA no 84 (1974).

    Google Scholar 

  26. W.F. OGDEN et W.C. ROUNDS, "Composing of n tree transducers". 4th ACM Proc. on theory of computing (1972) 198–206.

    Google Scholar 

  27. W.C. ROUNDS, "Trees, transducers and transformations". Ph. D. Dissertation, Stanford University (1968).

    Google Scholar 

  28. W.C. ROUNDS, "Context-free grammars on trees". 1st ACM Proc. on theory of computing (1969) 143–148.

    Google Scholar 

  29. W.C. ROUNDS, "Tree-oriented proofs of some theorems on context-free and indexed languages". 2nd ACM Proc. on theory of computing (1970) 109–116.

    Google Scholar 

  30. W.C. ROUNDS, "Mappings and grammars on trees". Math. Systems Theory 4 (1970) 257–287.

    Article  Google Scholar 

  31. M. TAKAHASHI, "Primitive transformations of regular sets and recognizable sets". In "Automata, Languages and Programming" (Nivat, Ed.).

    Google Scholar 

  32. M. TAKAHASHI, "Rational retations of binary trees". 4rd Automata, Languages and Programming, Turku (1977).

    Google Scholar 

  33. J.W. THATCHER, "Generalized2 sequential machine maps". J. Comput. System Sci. 4 (1970) 339–367.

    Google Scholar 

  34. J.W. THATCHER, "Tree automata: an informat survey". In "currents in the theory of computing" (A.V. Aho, Ed.) Prentice Hall (1973) 143–178.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lille I — Service Informatique Bât M3, B.P. 36, 59650, Villeneuve d'ASCQ

    A. Arnold & M. Dauchet

Authors
  1. A. Arnold
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Dauchet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Corrado Böhm

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arnold, A., Dauchet, M. (1978). Sur l'inversion des morphismes d'arbres. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-08860-1_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08860-8

  • Online ISBN: 978-3-540-35807-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation