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(s(x)) -> f(x)
0.16/0.22	 f(0()) -> s(0())
0.16/0.22	 f(s(x)) -> s(s(g(x)))
0.16/0.22	 g(0()) -> 0()
0.16/0.22	
0.16/0.22	Proof:
0.16/0.22	 Bounds Processor:
0.16/0.22	  bound: 1
0.16/0.22	  enrichment: match
0.16/0.22	  automaton:
0.16/0.22	   final states: {4,3}
0.16/0.22	   transitions:
0.16/0.22	    01() -> 15*
0.16/0.22	    s1(15) -> 16*
0.16/0.22	    s1(18) -> 19*
0.16/0.22	    g1(25) -> 26*
0.16/0.22	    g1(17) -> 18*
0.16/0.22	    f1(7) -> 8*
0.16/0.22	    f1(9) -> 10*
0.16/0.22	    g0(2) -> 3*
0.16/0.22	    g0(1) -> 3*
0.16/0.22	    s0(2) -> 1*
0.16/0.22	    s0(1) -> 1*
0.16/0.22	    f0(2) -> 4*
0.16/0.22	    f0(1) -> 4*
0.16/0.22	    00() -> 2*
0.16/0.22	    1 -> 25,9
0.16/0.22	    2 -> 17,7
0.16/0.22	    8 -> 26,18,3
0.16/0.22	    10 -> 26,18,3
0.16/0.22	    15 -> 18,3
0.16/0.22	    16 -> 10,8,3,4
0.16/0.22	    19 -> 15*
0.16/0.22	    26 -> 18*
0.16/0.22	  problem:
0.16/0.22	   
0.16/0.22	  Qed
0.16/0.23	EOF