The rewrite relation of the following TRS is considered.
b(a(a(b(a(b(x1)))))) | → | a(b(a(a(b(b(a(x1))))))) | (1) |
final states:
{0, 1}
transitions:
b0(0) | → | 0 |
b0(1) | → | 0 |
a0(0) | → | 1 |
a0(1) | → | 1 |
a1(0) | → | 7 |
b1(7) | → | 6 |
b1(6) | → | 5 |
a1(5) | → | 4 |
a1(4) | → | 3 |
b1(3) | → | 2 |
a1(2) | → | 0 |
a1(1) | → | 7 |
a1(3) | → | 7 |
a2(3) | → | 13 |
b2(13) | → | 12 |
b2(12) | → | 11 |
a2(11) | → | 10 |
a2(10) | → | 9 |
b2(9) | → | 8 |
a2(8) | → | 2 |
0 | → | 6 |