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,y) -> g(x,y)
0.16/0.21	 g(h(x),y) -> h(f(x,y))
0.16/0.21	 g(h(x),y) -> h(g(x,y))
0.16/0.21	
0.16/0.21	Proof:
0.16/0.21	 Bounds Processor:
0.16/0.21	  bound: 2
0.16/0.21	  enrichment: match
0.16/0.21	  automaton:
0.16/0.21	   final states: {3,2}
0.16/0.21	   transitions:
0.16/0.21	    h1(2) -> 3*
0.16/0.21	    h1(4) -> 4,2,3
0.16/0.21	    g1(1,1) -> 2*
0.16/0.21	    f1(1,1) -> 4*
0.16/0.21	    g2(1,1) -> 4*
0.16/0.21	    f0(1,1) -> 2*
0.16/0.21	    g0(1,1) -> 3*
0.16/0.21	    h0(1) -> 1*
0.16/0.21	  problem:
0.16/0.21	   
0.16/0.21	  Qed
0.16/0.22	EOF