YES(?,O(n^1))
0.16/0.22	YES(?,O(n^1))
0.16/0.22	
0.16/0.22	Problem:
0.16/0.22	 g(0()) -> 0()
0.16/0.22	 g(s(x)) -> f(g(x))
0.16/0.22	 f(0()) -> 0()
0.16/0.22	
0.16/0.22	Proof:
0.16/0.22	 Bounds Processor:
0.16/0.22	  bound: 2
0.16/0.22	  enrichment: match
0.16/0.22	  automaton:
0.16/0.22	   final states: {5,6}
0.16/0.22	   transitions:
0.16/0.22	    01() -> 8*
0.16/0.22	    f1(10) -> 11*
0.16/0.22	    g1(17) -> 18*
0.16/0.22	    g1(9) -> 10*
0.16/0.22	    02() -> 19*
0.16/0.22	    g0(5) -> 5*
0.16/0.22	    g0(6) -> 5*
0.16/0.22	    00() -> 5*
0.16/0.22	    s0(5) -> 6*
0.16/0.22	    s0(6) -> 6*
0.16/0.22	    f0(5) -> 5*
0.16/0.22	    f0(6) -> 5*
0.16/0.22	    5 -> 9*
0.16/0.22	    6 -> 17*
0.16/0.22	    8 -> 10,5
0.16/0.22	    11 -> 18,10,5
0.16/0.22	    18 -> 10*
0.16/0.22	    19 -> 11,5,18,10
0.16/0.22	  problem:
0.16/0.22	   
0.16/0.22	  Qed
0.16/0.22	EOF