Skip to main content
SpringerLink
Log in
Book cover

International Conference on Rewriting Techniques and Applications

RTA 1989: Rewriting Techniques and Applications pp 462–476Cite as

Fair termination is decidable for ground systems

  • Regular Papers
  • Conference paper
  • First Online:

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

Abstract

By summing up, we have reduced the problem of fair termination to the emptiness of the intersection of two constructible and recognizable forests. Since the family of recognizable forests is closed under intersection and since emptiness is decidable in this family, fair termination is decidable.

This work is supported in part by the PRC ”Mathematiques et Informatique” and the ”GRECO de Programmation”. Part of the ESPRIT Basic Research Actions, BRA ”Algebraic and Syntactic Methods in Computer Science” and BRA ”Computing by Graph Transformations”

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. W.S. BRAINERS: ”Tree-generating regular systems”, Inf. and Control 14 (1969), pp.217–231.

    Google Scholar 

  2. M. DAUCHET & S. TISON: ”Tree automata and decidability in ground term rewriting systems”, Rapport interne, Université de Lille I, et FCT'85, Lecture Notes in Computer Science vol.199, pp. 80–84 (1985).

    Google Scholar 

  3. M.DAUCHET, T.HEUILLARD, P.LESCANNE & S.TISON: ”Decidability of the confluence of ground term rewriting systems”, rapport INRIA 675 et LICS'87.

    Google Scholar 

  4. J. ENGELFRIET: ”Bottom-up and top-down tree transformations, a comparison”, Math. Systems Theory 9 (1975), pp. 198–231.

    Google Scholar 

  5. N.FRANCEZ: ”Fairness, Texts and Monographs in Computer Science, Springer Verlag, 1985.

    Google Scholar 

  6. G.HUET & D.LANKFORD: ”The uniform halting problem for term rewriting systems”, Rapport INRIA 283 (1978).

    Google Scholar 

  7. S.PORAT & N.FRANCEZ: ”Fairness in rewriting term systems”, RTA'85.

    Google Scholar 

  8. J.W. THATCHER: ”Tree automata: an informal survey”, Currents in the Theory of Computing, (A.V. Aho, Ed.) Prentice Hall (1973), pp.14.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFL-UA 369 CNRS, Université de Lille-Flandres-Artois, 59655, Villeneuve d'Ascq Cedex, France

    Sophie Tison

Authors
  1. Sophie Tison
    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

Tison, S. (1989). Fair termination is decidable for ground systems. 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_126

Download citation

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

  • 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