YES(?,O(n^1))
0.16/0.23	YES(?,O(n^1))
0.16/0.23	
0.16/0.23	Problem:
0.16/0.23	 b(x,y) -> c(a(c(y),a(0(),x)))
0.16/0.23	 a(y,x) -> y
0.16/0.23	 a(y,c(b(a(0(),x),0()))) -> b(a(c(b(0(),y)),x),0())
0.16/0.23	
0.16/0.23	Proof:
0.16/0.23	 Bounds Processor:
0.16/0.23	  bound: 1
0.16/0.23	  enrichment: match
0.16/0.23	  automaton:
0.16/0.23	   final states: {4,3}
0.16/0.23	   transitions:
0.16/0.23	    c1(12) -> 3*
0.16/0.23	    c1(2) -> 11*
0.16/0.23	    c1(1) -> 11*
0.16/0.23	    a1(9,2) -> 10*
0.16/0.23	    a1(11,10) -> 12*
0.16/0.23	    a1(9,1) -> 10*
0.16/0.23	    01() -> 9*
0.16/0.23	    b0(1,2) -> 3*
0.16/0.23	    b0(2,1) -> 3*
0.16/0.23	    b0(1,1) -> 3*
0.16/0.23	    b0(2,2) -> 3*
0.16/0.23	    c0(2) -> 1*
0.16/0.23	    c0(1) -> 1*
0.16/0.23	    a0(1,2) -> 4*
0.16/0.23	    a0(2,1) -> 4*
0.16/0.23	    a0(1,1) -> 4*
0.16/0.23	    a0(2,2) -> 4*
0.16/0.23	    00() -> 2*
0.16/0.23	    1 -> 4*
0.16/0.23	    2 -> 4*
0.16/0.23	    9 -> 10*
0.16/0.23	    11 -> 12*
0.16/0.23	  problem:
0.16/0.23	   
0.16/0.23	  Qed
0.16/0.24	EOF