* Step 1: Bounds WORST_CASE(?,O(n^1)) + Considered Problem: - Strict TRS: f(x,y) -> g(x,y) g(h(x),y) -> h(f(x,y)) g(h(x),y) -> h(g(x,y)) - Signature: {f/2,g/2} / {h/1} - Obligation: innermost runtime complexity wrt. defined symbols {f,g} and constructors {h} + Applied Processor: Bounds {initialAutomaton = minimal, enrichment = match} + Details: The problem is match-bounded by 2. The enriched problem is compatible with follwoing automaton. f_0(2,2) -> 1 f_1(2,2) -> 3 g_0(2,2) -> 1 g_1(2,2) -> 1 g_2(2,2) -> 3 h_0(2) -> 2 h_1(1) -> 1 h_1(1) -> 3 h_1(3) -> 1 h_1(3) -> 3 * Step 2: EmptyProcessor WORST_CASE(?,O(1)) + Considered Problem: - Weak TRS: f(x,y) -> g(x,y) g(h(x),y) -> h(f(x,y)) g(h(x),y) -> h(g(x,y)) - Signature: {f/2,g/2} / {h/1} - Obligation: innermost runtime complexity wrt. defined symbols {f,g} and constructors {h} + Applied Processor: EmptyProcessor + Details: The problem is already closed. The intended complexity is O(1). WORST_CASE(?,O(n^1))