The rewrite relation of the following TRS is considered.
fst(0,Z) | → | nil | (1) |
fst(s,cons(Y)) | → | cons(Y) | (2) |
from(X) | → | cons(X) | (3) |
add(0,X) | → | X | (4) |
add(s,Y) | → | s | (5) |
len(nil) | → | 0 | (6) |
len(cons(X)) | → | s | (7) |
final states:
{0, 1, 2, 3, 4}
transitions:
00 | → | 0 |
nil0 | → | 0 |
s0 | → | 0 |
cons0(0) | → | 0 |
fst0(0,0) | → | 1 |
from0(0) | → | 2 |
add0(0,0) | → | 3 |
len0(0) | → | 4 |
nil1 | → | 1 |
cons1(0) | → | 1 |
cons1(0) | → | 2 |
s1 | → | 3 |
01 | → | 4 |
s1 | → | 4 |
0 | → | 3 |