YES(?,O(n^1)) 0.16/0.27 YES(?,O(n^1)) 0.16/0.27 0.16/0.27 Problem: 0.16/0.27 a__c() -> a__f(g(c())) 0.16/0.27 a__f(g(X)) -> g(X) 0.16/0.27 mark(c()) -> a__c() 0.16/0.27 mark(f(X)) -> a__f(X) 0.16/0.27 mark(g(X)) -> g(X) 0.16/0.27 a__c() -> c() 0.16/0.27 a__f(X) -> f(X) 0.16/0.27 0.16/0.27 Proof: 0.16/0.27 Bounds Processor: 0.16/0.27 bound: 3 0.16/0.27 enrichment: match 0.16/0.27 automaton: 0.16/0.27 final states: {6,5,4} 0.16/0.27 transitions: 0.16/0.27 f1(45) -> 46* 0.16/0.27 f1(47) -> 48* 0.16/0.27 f1(39) -> 40* 0.16/0.27 c1() -> 7* 0.16/0.27 g1(15) -> 16* 0.16/0.27 g1(17) -> 18* 0.16/0.27 g1(7) -> 8* 0.16/0.27 g1(23) -> 24* 0.16/0.27 a__f1(37) -> 38* 0.16/0.27 a__f1(29) -> 30* 0.16/0.27 a__f1(31) -> 32* 0.16/0.27 a__f1(8) -> 9* 0.16/0.27 a__c1() -> 25* 0.16/0.27 f2(75) -> 76* 0.16/0.27 f2(67) -> 68* 0.16/0.27 f2(69) -> 70* 0.16/0.27 f2(61) -> 62* 0.16/0.27 c2() -> 54* 0.16/0.27 a__c0() -> 4* 0.16/0.27 g2(59) -> 60* 0.16/0.27 g2(54) -> 55* 0.16/0.27 a__f0(2) -> 5* 0.16/0.27 a__f0(1) -> 5* 0.16/0.27 a__f0(3) -> 5* 0.16/0.27 a__f2(55) -> 56* 0.16/0.27 g0(2) -> 1* 0.16/0.27 g0(1) -> 1* 0.16/0.27 g0(3) -> 1* 0.16/0.27 f3(83) -> 84* 0.16/0.27 c0() -> 2* 0.16/0.27 g3(79) -> 80* 0.16/0.27 mark0(2) -> 6* 0.16/0.27 mark0(1) -> 6* 0.16/0.27 mark0(3) -> 6* 0.16/0.27 f0(2) -> 3* 0.16/0.27 f0(1) -> 3* 0.16/0.27 f0(3) -> 3* 0.16/0.27 1 -> 45,31,17 0.16/0.27 2 -> 47,29,15 0.16/0.27 3 -> 39,37,23 0.16/0.27 7 -> 59,4 0.16/0.27 8 -> 75* 0.16/0.27 9 -> 4* 0.16/0.27 16 -> 32,6,5 0.16/0.27 18 -> 32,6,5 0.16/0.27 24 -> 32,6,5 0.16/0.27 25 -> 6* 0.16/0.27 29 -> 61* 0.16/0.27 30 -> 6* 0.16/0.27 31 -> 67* 0.16/0.27 32 -> 6* 0.16/0.27 37 -> 69* 0.16/0.27 38 -> 6* 0.16/0.27 40 -> 5* 0.16/0.27 46 -> 5* 0.16/0.27 48 -> 5* 0.16/0.27 54 -> 79,25,6 0.16/0.27 55 -> 83* 0.16/0.27 56 -> 25,6 0.16/0.27 60 -> 9,4 0.16/0.27 62 -> 30* 0.16/0.27 68 -> 32,6 0.16/0.27 70 -> 38,6 0.16/0.27 76 -> 9,4 0.16/0.27 80 -> 56,25 0.16/0.27 84 -> 56,25 0.16/0.27 problem: 0.16/0.27 0.16/0.27 Qed 0.16/0.27 EOF