YES(?,O(n^1))
0.16/0.21	YES(?,O(n^1))
0.16/0.21	
0.16/0.21	Problem:
0.16/0.21	 f(x,a()) -> x
0.16/0.21	 f(x,g(y)) -> f(g(x),y)
0.16/0.21	
0.16/0.21	Proof:
0.16/0.21	 Bounds Processor:
0.16/0.21	  bound: 1
0.16/0.21	  enrichment: match
0.16/0.21	  automaton:
0.16/0.21	   final states: {3}
0.16/0.21	   transitions:
0.16/0.21	    f1(4,2) -> 3*
0.16/0.21	    f1(4,1) -> 3*
0.16/0.21	    g1(2) -> 4*
0.16/0.21	    g1(4) -> 4*
0.16/0.21	    g1(1) -> 4*
0.16/0.21	    f0(1,2) -> 3*
0.16/0.21	    f0(2,1) -> 3*
0.16/0.21	    f0(1,1) -> 3*
0.16/0.21	    f0(2,2) -> 3*
0.16/0.21	    a0() -> 1*
0.16/0.21	    g0(2) -> 2*
0.16/0.21	    g0(1) -> 2*
0.16/0.21	    1 -> 3*
0.16/0.21	    2 -> 3*
0.16/0.21	    4 -> 3*
0.16/0.21	  problem:
0.16/0.21	   
0.16/0.21	  Qed
0.16/0.21	EOF