The rewrite relation of the following TRS is considered.
f(f(a)) | → | f(g(n__f(a))) | (1) |
f(X) | → | n__f(X) | (2) |
activate(n__f(X)) | → | f(X) | (3) |
activate(X) | → | X | (4) |
final states:
{0, 1, 2, 3, 4}
transitions:
f0(0) | → | 0 |
f0(1) | → | 0 |
f0(2) | → | 0 |
f0(3) | → | 0 |
f0(4) | → | 0 |
a0 | → | 1 |
g0(0) | → | 2 |
g0(1) | → | 2 |
g0(2) | → | 2 |
g0(3) | → | 2 |
g0(4) | → | 2 |
n__f0(0) | → | 3 |
n__f0(1) | → | 3 |
n__f0(2) | → | 3 |
n__f0(3) | → | 3 |
n__f0(4) | → | 3 |
activate0(0) | → | 4 |
activate0(1) | → | 4 |
activate0(2) | → | 4 |
activate0(3) | → | 4 |
activate0(4) | → | 4 |
a1 | → | 7 |
n__f1(7) | → | 6 |
g1(6) | → | 5 |
f1(5) | → | 0 |
n__f1(0) | → | 0 |
n__f1(1) | → | 0 |
n__f1(2) | → | 0 |
n__f1(3) | → | 0 |
n__f1(4) | → | 0 |
f1(0) | → | 4 |
f1(1) | → | 4 |
f1(2) | → | 4 |
f1(3) | → | 4 |
f1(4) | → | 4 |
n__f2(5) | → | 0 |
n__f2(0) | → | 0 |
n__f2(1) | → | 0 |
n__f2(2) | → | 0 |
n__f2(3) | → | 0 |
n__f2(4) | → | 0 |
0 | → | 4 |
1 | → | 4 |
2 | → | 4 |
3 | → | 4 |