Skip to main content
SpringerLink
Log in

Le théorème de transversale rationnelle dans les langages d'arbres

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

We prove that ifφ is a linear homomorphism between the setsT ∑ andT Δ of trees built up from the graded alphabets ∑ and Δ then every recognizable setF inT ∑ contains a recognizable subset which is in bijection byφ withφ(F).

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Article 18 January 2023

Frédéric Haglund & Daniel T. Wise

References

  1. A. Arnold. “Systèmes d'équations dans le magmoide. Ensembles rationnels et algébriques d'arbres”, Thèse d'Etat, Lille (1977).

  2. A. Arnold, M. Dauchet. Un théorème de duplication pour les forêts algébriques.J. Comput. System Sci. 13 (1976), 223–244.

    Google Scholar 

  3. A. Arnold, M. Dauchet. Forêts algébriques et homomorphismes inverses.Information and Control 37 (1978), 182–196.

    Google Scholar 

  4. A. Arnold, M. Dauchet. Sur l'inversion des morphismes d'arbres,in “Automata, Languages and Programming“, 5th colloquim Udine, 1978 (Ausiello and Böhm, Eds) Lecture Notes in Computer Science, no. 62, Springer Verlag (1978) 26–35.

  5. A. Arnold, M. Latteux. A new proof of two theorems about rational transductions.Theoretical Computer Science 8 (1979), 261–263.

    Google Scholar 

  6. M. Dauchet. “Transductions de forêts. Bimorphismes de magmoides". Thèse d'Etat, Lille (1977).

  7. S. Eilenberg.Automata, languages and machines, vol. A, Academic Press, New York & London (1974).

    Google Scholar 

  8. J. Engelfriet. Bottom-up and top-down tree transformations. A comparison.Math. Systems Theory 9 (1975) 193–231.

    Google Scholar 

  9. J. Engelfriet. On tree-transducers for partial functions.Inf. Proc. Letters 7 (1978), 170–172.

    Google Scholar 

  10. W. C. Rounds. Mappings and grammars on trees.Math Systems Theory 4 (1970) 257–287.

    Google Scholar 

  11. J. Sakarovitch. Théorème de transversale rationnelle pour les automates à pile déterministes, in 4th Gi Conference on Theoretical Computer Science Aachen, 1979 (K. Weihrauch, Ed) Lecture Notes in Computer Science no. 67, Springer-Verlag (1979).

  12. M. P. Schützenberger. Sur les relations rationnelles entre monoides libres.Theoretical Computer Science 3 (1976) 243–259.

    Google Scholar 

  13. J. W. Thatcher, J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic.Math. Systems Theory 2 (1969) 57–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Poitiers Laboratoire d'Informatique, 40, avenue du Recteur Pineau, 86022, Poitiers, Cedex, France

    A. Arnold

Authors
  1. A. Arnold
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Arnold, A. Le théorème de transversale rationnelle dans les langages d'arbres. Math. Systems Theory 13, 275–282 (1979). https://doi.org/10.1007/BF01744300

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01744300

Search

Navigation