Certification Problem
Input (TPDB Runtime_Complexity_Innermost_Rewriting/Transformed_CSR_04/ExProp7_Luc06_L)
The rewrite relation of the following TRS is considered.
|
f(0) |
→ |
cons(0) |
(1) |
|
f(s(0)) |
→ |
f(p(s(0))) |
(2) |
|
p(s(X)) |
→ |
X |
(3) |
The evaluation strategy is innermost.Property / Task
Determine bounds on the runtime complexity.Answer / Result
An upperbound for the complexity is O(n).Proof (by AProVE @ termCOMP 2023)
1 Bounds
The given TRS is
match-(raise)-bounded by 2.
This is shown by the following automaton.
-
final states:
{0, 1, 2}
-
transitions:
|
00
|
→ |
0 |
|
cons0(0) |
→ |
0 |
|
s0(0) |
→ |
0 |
|
f0(0) |
→ |
1 |
|
p0(0) |
→ |
2 |
|
01
|
→ |
3 |
|
cons1(3) |
→ |
1 |
|
01
|
→ |
6 |
|
s1(6) |
→ |
5 |
|
p1(5) |
→ |
4 |
|
f1(4) |
→ |
1 |
|
02
|
→ |
7 |
|
cons2(7) |
→ |
1 |
| 0 |
→ |
2 |
| 6 |
→ |
4 |