The rewrite relation of the following TRS is considered.
f(0) | → | cons(0) | (1) |
f(s(0)) | → | f(p(s(0))) | (2) |
p(s(X)) | → | X | (3) |
final states:
{0, 1, 2, 3, 4}
transitions:
f0(0) | → | 0 |
f0(1) | → | 0 |
f0(2) | → | 0 |
f0(3) | → | 0 |
f0(4) | → | 0 |
00 | → | 1 |
cons0(0) | → | 2 |
cons0(1) | → | 2 |
cons0(2) | → | 2 |
cons0(3) | → | 2 |
cons0(4) | → | 2 |
s0(0) | → | 3 |
s0(1) | → | 3 |
s0(2) | → | 3 |
s0(3) | → | 3 |
s0(4) | → | 3 |
p0(0) | → | 4 |
p0(1) | → | 4 |
p0(2) | → | 4 |
p0(3) | → | 4 |
p0(4) | → | 4 |
01 | → | 5 |
cons1(5) | → | 0 |
s1(5) | → | 7 |
p1(7) | → | 6 |
f1(6) | → | 0 |
02 | → | 8 |
cons2(8) | → | 0 |
0 | → | 4 |
1 | → | 4 |
2 | → | 4 |
3 | → | 4 |
5 | → | 6 |