Skip to main content
SpringerLink
Log in

Embedding with patterns and associated recursive path ordering

  • Regular Papers
  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1989)

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

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.

References

  1. N. Dershowitz. Ordering for Term Rewriting Systems. Theoretical Computer Science 17 (1982) 279–300

    Google Scholar 

  2. N. Dershowitz. Termination of Rewriting J. of Symbolic Computation (1987)

    Google Scholar 

  3. A. Erhenfeucht, D. Haussler, G. Rozenberg. On Regularity of Context-Free Languages. Theoretical Computer Science 27 (1983) 311–332

    Google Scholar 

  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 1980

    Google Scholar 

  5. J.B. Kruskal. Well Quasi-Ordering, the Tree Theorem and Vaszonyi's Conjecture. Trans. AMS 95 (1960) 210–225

    Google Scholar 

  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. L.Puel. Using Unavoidable Sets of Trees to Generalize Kruskal's Theorem. To appear J. of Symbolic Computation

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIENS, URA 1327 CNRS Ecole Normale Supérieure, 45 rue d'Ulm, 75005, Paris, France

    Laurence Puel

Authors
  1. Laurence Puel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nachum Dershowitz

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Puel, L. (1989). Embedding with patterns and associated recursive path ordering. In: Dershowitz, N. (eds) Rewriting Techniques and Applications. RTA 1989. Lecture Notes in Computer Science, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51081-8_120

Download citation

  • DOI: https://doi.org/10.1007/3-540-51081-8_120

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51081-9

  • Online ISBN: 978-3-540-46149-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation