The rewrite relation of the following TRS is considered.
f(X) | → | g(n__h(n__f(X))) | (1) |
h(X) | → | n__h(X) | (2) |
f(X) | → | n__f(X) | (3) |
activate(n__h(X)) | → | h(activate(X)) | (4) |
activate(n__f(X)) | → | f(activate(X)) | (5) |
activate(X) | → | X | (6) |
final states:
{0, 1, 2, 3}
transitions:
g0(0) | → | 0 |
n__h0(0) | → | 0 |
n__f0(0) | → | 0 |
f0(0) | → | 1 |
h0(0) | → | 2 |
activate0(0) | → | 3 |
n__f1(0) | → | 5 |
n__h1(5) | → | 4 |
g1(4) | → | 1 |
n__h1(0) | → | 2 |
n__f1(0) | → | 1 |
activate1(0) | → | 6 |
h1(6) | → | 3 |
activate1(0) | → | 7 |
f1(7) | → | 3 |
n__f2(7) | → | 9 |
n__h2(9) | → | 8 |
g2(8) | → | 3 |
n__h2(6) | → | 3 |
n__f2(7) | → | 3 |
h1(6) | → | 6 |
h1(6) | → | 7 |
f1(7) | → | 6 |
f1(7) | → | 7 |
g2(8) | → | 6 |
g2(8) | → | 7 |
n__h2(6) | → | 6 |
n__h2(6) | → | 7 |
n__f2(7) | → | 6 |
n__f2(7) | → | 7 |
0 | → | 3 |
0 | → | 6 |
0 | → | 7 |