The rewrite relation of the following TRS is considered.
a__c | → | a__f(g(c)) | (1) |
a__f(g(X)) | → | g(X) | (2) |
mark(c) | → | a__c | (3) |
mark(f(X)) | → | a__f(X) | (4) |
mark(g(X)) | → | g(X) | (5) |
a__c | → | c | (6) |
a__f(X) | → | f(X) | (7) |
final states:
{1, 2}
transitions:
a__c0 | → | 1 |
a__f0(2) | → | 1 |
mark0(2) | → | 1 |
c1 | → | 1 |
f1(2) | → | 1 |
g1(2) | → | 1 |
a__c1 | → | 1 |
a__f1(2) | → | 1 |
c2 | → | 1 |
f2(2) | → | 1 |
a__f1(3) | → | 1 |
f2(3) | → | 1 |
a__f2(5) | → | 1 |
f3(5) | → | 1 |
g2(4) | → | 1 |
g3(6) | → | 1 |
g0(2) | → | 2 |
c0 | → | 2 |
f0(2) | → | 2 |
g1(4) | → | 3 |
c1 | → | 4 |
g2(6) | → | 5 |
c2 | → | 6 |