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