Fair termination is decidable for ground systems

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


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.


Inference Rule Graph Transformation Fair Termination Ground System Ground Term 
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]
    W.S. BRAINERS: ”Tree-generating regular systems”, Inf. and Control 14 (1969), pp.217–231.Google Scholar
  2. [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. [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. [4]
    J. ENGELFRIET: ”Bottom-up and top-down tree transformations, a comparison”, Math. Systems Theory 9 (1975), pp. 198–231.Google Scholar
  5. [5]
    N.FRANCEZ: ”Fairness, Texts and Monographs in Computer Science, Springer Verlag, 1985.Google Scholar
  6. [6]
    G.HUET & D.LANKFORD: ”The uniform halting problem for term rewriting systems”, Rapport INRIA 283 (1978).Google Scholar
  7. [7]
    S.PORAT & N.FRANCEZ: ”Fairness in rewriting term systems”, RTA'85.Google Scholar
  8. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Sophie Tison
    • 1
  1. 1.LIFL-UA 369 CNRSUniversité de Lille-Flandres-ArtoisVilleneuve d'Ascq CedexFrance

Personalised recommendations