Embedding with patterns and associated recursive path ordering

  • Laurence Puel
Regular Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 355)


Term Structure Tree Decomposition Terminal Vertex Decomposition Pattern Finite Alphabet 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    N. Dershowitz. Ordering for Term Rewriting Systems. Theoretical Computer Science 17 (1982) 279–300Google Scholar
  2. [2]
    N. Dershowitz. Termination of Rewriting J. of Symbolic Computation (1987)Google Scholar
  3. [3]
    A. Erhenfeucht, D. Haussler, G. Rozenberg. On Regularity of Context-Free Languages. Theoretical Computer Science 27 (1983) 311–332Google Scholar
  4. [4]
    S. Kamin, J.J. Levy. Two Generalizations of the Recursive Path Ordering. Unpublished note, Department of computer science, University of Illinois, Urbana, IL, February 1980Google Scholar
  5. [5]
    J.B. Kruskal. Well Quasi-Ordering, the Tree Theorem and Vaszonyi's Conjecture. Trans. AMS 95 (1960) 210–225Google Scholar
  6. [6]
    L. Puel. Bons Preordres sur les Arbres Associes a des Ensembles Inevitables et Preuves de Terminaison de Systemes de Reecriture. These d'Etat, Paris 1987.Google Scholar
  7. [7]
    L.Puel. Using Unavoidable Sets of Trees to Generalize Kruskal's Theorem. To appear J. of Symbolic ComputationGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Laurence Puel
    • 1
  1. 1.LIENS, URA 1327 CNRS Ecole Normale SupérieureParisFrance

Personalised recommendations