Skip to main content
SpringerLink
Log in

Compilation of ground term rewriting systems and applications (DEMO)

  • System Descriptions
  • 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

Bibliography

  1. BRAINERS: Tree-generating regular systems, Info and control (1969)

    Google Scholar 

  2. G.W. BRAMS: Reseaux de Petri:theorie et pratique, tomes 1&2, Masson, Paris (1983)

    Google Scholar 

  3. CHEW: An improved algorithm for computing with equations, 21st FOCS (1980)

    Google Scholar 

  4. DAUCHET, HEUILLARD, LESCANNE, TISON: The confluence of ground term tewriting systems is decidable,2nd LICS (1987)

    Google Scholar 

  5. DAUCHET & TISON: Tree automata and decidability in ground term rewriting systems FCT' 85 (LNCS no 199)

    Google Scholar 

  6. N.DERSHOWITZ, J.HSIANG,N.JOSEPHSON and D.PLAISTED: Associative-commutative rewriting, Proc. 10th IJCAI, LNCS 202 (1983)

    Google Scholar 

  7. GECSEG F. & STEINBY M: tree automata, Akadémiai Kiado, Budapest (1984)

    Google Scholar 

  8. HUET.G & OPPEN.D.: Equations and rewrite rules:a survey,in formal languages:perspective and open problems, Ed.Book R.,Academic Press (1980)

    Google Scholar 

  9. J.P.JOUANNAUD: Church-Rosser computations with equational term rewriting systems, Proc.4th Conf on Automata,Algebra and programming,LNCS 159 (1983)

    Google Scholar 

  10. C.KIRCHNER: Methodes et outils de conception systematique d'algorithmes d'unification dans les théories équationnelles, These d'etat de l'universite de Nancy I (1985)

    Google Scholar 

  11. S.R.KOSARAJU: Decidability of reachability in vector addition systems, Proc. 14th Ann.Symp.on Theory of Computing,267–281.(1982)

    Google Scholar 

  12. KOZEN: Complexity of finitely presented algebra, 9th ACM th. comp. (1977)

    Google Scholar 

  13. E.W. MAYR: An algorithm for the general Petri net reachability problem, Siam J Comput. 13 441.–460

    Google Scholar 

  14. NELSON & OPPEN: Fast decision algorithms based on congruence closure, JACM 27 (1980)

    Google Scholar 

  15. OYAMAGUCHI M.: The reachability problem for quasi-ground Term Rewriting Systems, Journal of Information Processing, vol 9, no4 (1986)

    Google Scholar 

  16. DERUYVER, À. and R. GILLERON, The reachability problem for ground TRS and some extensions, to appear in CAAP' 89 proceedings, Diaz editor, LNCS, Barcelona, march 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFL (UA 369 CNRS) Universite des sciences et techniques de LILLE FLANDERS ARTOIS U.F.R. d' I.E.E.A. Bat. M3 59655, Villeneuve d'Ascq Cedex, France

    M. Dauchet & A. Deruyver

Authors
  1. M. Dauchet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Deruyver
    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

Dauchet, M., Deruyver, A. (1989). Compilation of ground term rewriting systems and applications (DEMO). 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_137

Download citation

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

  • 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