Certification Problem
Input (TPDB Runtime_Complexity_Innermost_Rewriting/Strategy_removed_AG01/#4.37)
The rewrite relation of the following TRS is considered.
|
f(c(s(x),y)) |
→ |
f(c(x,s(y))) |
(1) |
|
g(c(x,s(y))) |
→ |
g(c(s(x),y)) |
(2) |
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 1.
This is shown by the following automaton.
-
final states:
{0, 1, 2}
-
transitions:
|
c0(0,0) |
→ |
0 |
|
s0(0) |
→ |
0 |
|
f0(0) |
→ |
1 |
|
g0(0) |
→ |
2 |
|
s1(0) |
→ |
4 |
|
c1(0,4) |
→ |
3 |
|
f1(3) |
→ |
1 |
|
s1(0) |
→ |
6 |
|
c1(6,0) |
→ |
5 |
|
g1(5) |
→ |
2 |
|
s1(4) |
→ |
4 |
|
s1(6) |
→ |
6 |