Advertisement

Differents types de derivations infinies dans les grammaires algebriques d'arbres

  • N. Polian
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 112)

Keywords

Recursive Program Nous Proposons Condition Suivante Homomorphismes Inverse Obtient Alors 
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.

References

  1. [1]
    A. Arnold, M. Dauchet. Un théorème de duplication pour les forêts algébriques. J. Comput. System Sci. 13 (1976) p. 223–244.Google Scholar
  2. [2]
    A. Arnold, M. Dauchet. Forêts algébriques et homomorphismes inverses. Information and control 37 (1978) p. 182–196.Google Scholar
  3. [3]
    A. Arnold, M. Nivat. Formal computations of non-deterministic recursive program schemes. Math. Syst. Theory 13 (1980) p. 219–236.Google Scholar
  4. [4]
    S. Bloom, R. Tindell. Compatible orderings on the metric theory of trees. SIAM J. Comput.Vol. 9, no 4 (Nov. 1980).Google Scholar
  5. [5]
    J. Engelfriet, E.M. Schmidt. IO and OI. J. Comput. System. Sci. 15 (1977) p. 328–353.Google Scholar
  6. [6]
    B. Leguy, Réductions, transformations et classification des grammaires algébriques d'arbres. Thèse 3è cycle, Lille (1980).Google Scholar
  7. [7]
    M. Nivat. Mots infinis engendrés par une grammaire algébrique. RAIRO Informatique théorique 11 (1977) p. 311–327 et 12 (1978)p. 259–278.Google Scholar
  8. [8]
    W.C. Rounds. Mapping and Grammars on trees. Math. Syst. Theory 4, p. 257–287.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • N. Polian
    • 1
  1. 1.Laboratoire d'InformatiqueUniversité de PoitiersPoitiersFrance

Personalised recommendations