* Step 1: ToInnermost WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: rev(++(x,x)) -> rev(x) rev(++(x,y)) -> ++(rev(y),rev(x)) rev(a()) -> a() rev(b()) -> b() - Signature: {rev/1} / {++/2,a/0,b/0} - Obligation: runtime complexity wrt. defined symbols {rev} and constructors {++,a,b} + Applied Processor: ToInnermost + Details: switch to innermost, as the system is overlay and right linear and does not contain weak rules * Step 2: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: rev(++(x,x)) -> rev(x) rev(++(x,y)) -> ++(rev(y),rev(x)) rev(a()) -> a() rev(b()) -> b() - Signature: {rev/1} / {++/2,a/0,b/0} - Obligation: innermost runtime complexity wrt. defined symbols {rev} and constructors {++,a,b} + Applied Processor: Bounds {initialAutomaton = perSymbol, enrichment = match} + Details: The problem is match-bounded by 1. The enriched problem is compatible with follwoing automaton. ++_0(1,1) -> 1 ++_0(1,2) -> 1 ++_0(1,3) -> 1 ++_0(2,1) -> 1 ++_0(2,2) -> 1 ++_0(2,3) -> 1 ++_0(3,1) -> 1 ++_0(3,2) -> 1 ++_0(3,3) -> 1 ++_1(4,4) -> 4 a_0() -> 2 a_1() -> 4 b_0() -> 3 b_1() -> 4 rev_0(1) -> 4 rev_0(2) -> 4 rev_0(3) -> 4 rev_1(1) -> 4 rev_1(2) -> 4 rev_1(3) -> 4 * Step 3: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: rev(++(x,x)) -> rev(x) rev(++(x,y)) -> ++(rev(y),rev(x)) rev(a()) -> a() rev(b()) -> b() - Signature: {rev/1} / {++/2,a/0,b/0} - Obligation: innermost runtime complexity wrt. defined symbols {rev} and constructors {++,a,b} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))