The rewrite relation of the following TRS is considered.
f(f(x)) | → | f(c(f(x))) | (1) |
f(f(x)) | → | f(d(f(x))) | (2) |
g(c(x)) | → | x | (3) |
g(d(x)) | → | x | (4) |
g(c(0)) | → | g(d(1)) | (5) |
g(c(1)) | → | g(d(0)) | (6) |
final states:
{0, 1, 2, 3, 4, 5}
transitions:
f0(0) | → | 0 |
f0(1) | → | 0 |
f0(2) | → | 0 |
f0(3) | → | 0 |
f0(4) | → | 0 |
f0(5) | → | 0 |
c0(0) | → | 1 |
c0(1) | → | 1 |
c0(2) | → | 1 |
c0(3) | → | 1 |
c0(4) | → | 1 |
c0(5) | → | 1 |
d0(0) | → | 2 |
d0(1) | → | 2 |
d0(2) | → | 2 |
d0(3) | → | 2 |
d0(4) | → | 2 |
d0(5) | → | 2 |
g0(0) | → | 3 |
g0(1) | → | 3 |
g0(2) | → | 3 |
g0(3) | → | 3 |
g0(4) | → | 3 |
g0(5) | → | 3 |
00 | → | 4 |
10 | → | 5 |
f1(0) | → | 7 |
c1(7) | → | 6 |
f1(6) | → | 0 |
f1(1) | → | 7 |
f1(2) | → | 7 |
f1(3) | → | 7 |
f1(4) | → | 7 |
f1(5) | → | 7 |
d1(7) | → | 6 |
11 | → | 9 |
d1(9) | → | 8 |
g1(8) | → | 0 |
01 | → | 9 |
f2(6) | → | 11 |
c2(11) | → | 10 |
f2(10) | → | 0 |
d2(11) | → | 10 |
f1(10) | → | 0 |
0 | → | 3 |
0 | → | 7 |
0 | → | 11 |
1 | → | 3 |
2 | → | 3 |
4 | → | 3 |
5 | → | 3 |
9 | → | 0 |