The rewrite relation of the following TRS is considered.
f(a) | → | f(b) | (1) |
g(b) | → | g(a) | (2) |
final states:
{0, 1, 2, 3}
transitions:
f0(0) | → | 0 |
f0(1) | → | 0 |
f0(2) | → | 0 |
f0(3) | → | 0 |
a0 | → | 1 |
b0 | → | 2 |
g0(0) | → | 3 |
g0(1) | → | 3 |
g0(2) | → | 3 |
g0(3) | → | 3 |
b1 | → | 4 |
f1(4) | → | 0 |
a1 | → | 5 |
g1(5) | → | 3 |