The rewrite relation of the following TRS is considered.
| b(a(b(c(c(b(x1)))))) | → | a(b(b(c(c(b(a(x1))))))) | (1) |
final states:
{0, 1, 2}
transitions:
| b0(0) | → | 0 |
| b0(1) | → | 0 |
| b0(2) | → | 0 |
| a0(0) | → | 1 |
| a0(1) | → | 1 |
| a0(2) | → | 1 |
| c0(0) | → | 2 |
| c0(1) | → | 2 |
| c0(2) | → | 2 |
| a1(0) | → | 8 |
| b1(8) | → | 7 |
| c1(7) | → | 6 |
| c1(6) | → | 5 |
| b1(5) | → | 4 |
| b1(4) | → | 3 |
| a1(3) | → | 0 |
| a1(1) | → | 8 |
| a1(2) | → | 8 |
| 0 | → | 7 |