The rewrite relation of the following TRS is considered.
a__g(X) | → | a__h(X) | (1) |
a__c | → | d | (2) |
a__h(d) | → | a__g(c) | (3) |
mark(g(X)) | → | a__g(X) | (4) |
mark(h(X)) | → | a__h(X) | (5) |
mark(c) | → | a__c | (6) |
mark(d) | → | d | (7) |
a__g(X) | → | g(X) | (8) |
a__h(X) | → | h(X) | (9) |
a__c | → | c | (10) |
final states:
{1, 2}
transitions:
a__g0(2) | → | 1 |
a__c0 | → | 1 |
a__h0(2) | → | 1 |
mark0(2) | → | 1 |
a__h1(2) | → | 1 |
g1(2) | → | 1 |
d1 | → | 1 |
c1 | → | 1 |
h1(2) | → | 1 |
a__g1(2) | → | 1 |
a__c1 | → | 1 |
a__h2(2) | → | 1 |
g2(2) | → | 1 |
d2 | → | 1 |
c2 | → | 1 |
h2(2) | → | 1 |
h3(2) | → | 1 |
a__g1(13) | → | 1 |
a__h2(13) | → | 1 |
g2(13) | → | 1 |
h3(13) | → | 1 |
d0 | → | 2 |
c0 | → | 2 |
g0(2) | → | 2 |
h0(2) | → | 2 |
c1 | → | 13 |