The rewrite relation of the following TRS is considered.
| f(a) | → | f(c(a)) | (1) |
| f(c(X)) | → | X | (2) |
| f(c(a)) | → | f(d(b)) | (3) |
| f(a) | → | f(d(a)) | (4) |
| f(d(X)) | → | X | (5) |
| f(c(b)) | → | f(d(a)) | (6) |
| e(g(X)) | → | e(X) | (7) |
final states:
{0, 1, 2, 3, 4, 5, 6}
transitions:
| f0(0) | → | 0 |
| f0(1) | → | 0 |
| f0(2) | → | 0 |
| f0(3) | → | 0 |
| f0(4) | → | 0 |
| f0(5) | → | 0 |
| f0(6) | → | 0 |
| a0 | → | 1 |
| c0(0) | → | 2 |
| c0(1) | → | 2 |
| c0(2) | → | 2 |
| c0(3) | → | 2 |
| c0(4) | → | 2 |
| c0(5) | → | 2 |
| c0(6) | → | 2 |
| d0(0) | → | 3 |
| d0(1) | → | 3 |
| d0(2) | → | 3 |
| d0(3) | → | 3 |
| d0(4) | → | 3 |
| d0(5) | → | 3 |
| d0(6) | → | 3 |
| b0 | → | 4 |
| e0(0) | → | 5 |
| e0(1) | → | 5 |
| e0(2) | → | 5 |
| e0(3) | → | 5 |
| e0(4) | → | 5 |
| e0(5) | → | 5 |
| e0(6) | → | 5 |
| g0(0) | → | 6 |
| g0(1) | → | 6 |
| g0(2) | → | 6 |
| g0(3) | → | 6 |
| g0(4) | → | 6 |
| g0(5) | → | 6 |
| g0(6) | → | 6 |
| a1 | → | 8 |
| c1(8) | → | 7 |
| f1(7) | → | 0 |
| b1 | → | 9 |
| d1(9) | → | 7 |
| e1(0) | → | 5 |
| b2 | → | 11 |
| d2(11) | → | 10 |
| f2(10) | → | 0 |
| 1 | → | 0 |
| 2 | → | 0 |
| 3 | → | 0 |
| 4 | → | 0 |
| 5 | → | 0 |
| 6 | → | 0 |
| 8 | → | 9 |
| 8 | → | 0 |
| 9 | → | 0 |
| 11 | → | 0 |