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