A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
The reachability problem for ground TRS and some extensions
[chapter]
1989
Lecture Notes in Computer Science
~S~A~ The reachability problem for term rewriting systems (TRS) is the problem of deciding, for a given TRS S and two terms M and N, whether M can reduce to N by applying the rules of S. We show in this paper by some new methods based on algebraical tools of tree automata, the decidability of this problem for ground TRS's and, for every ground TRS S, we built a decision algorithm. In the order to obtain it, we compile the system S and the compiled algorithm works in a real time (as a fonction
doi:10.1007/3-540-50939-9_135
fatcat:a7gr7pn6ofaxdgncr5arg4n7j4