The rewrite relation of the following TRS is considered.
filter(cons(X),0,M) | → | cons(0) | (1) |
filter(cons(X),s(N),M) | → | cons(X) | (2) |
sieve(cons(0)) | → | cons(0) | (3) |
sieve(cons(s(N))) | → | cons(s(N)) | (4) |
nats(N) | → | cons(N) | (5) |
zprimes | → | sieve(nats(s(s(0)))) | (6) |
final states:
{0, 1, 2, 3, 4}
transitions:
cons0(0) | → | 0 |
00 | → | 0 |
s0(0) | → | 0 |
filter0(0,0,0) | → | 1 |
sieve0(0) | → | 2 |
nats0(0) | → | 3 |
zprimes0 | → | 4 |
01 | → | 5 |
cons1(5) | → | 1 |
cons1(0) | → | 1 |
cons1(5) | → | 2 |
s1(0) | → | 6 |
cons1(6) | → | 2 |
cons1(0) | → | 3 |
01 | → | 10 |
s1(10) | → | 9 |
s1(9) | → | 8 |
nats1(8) | → | 7 |
sieve1(7) | → | 4 |
cons2(8) | → | 7 |
s2(9) | → | 11 |
cons2(11) | → | 4 |