YES(?,O(n^1))
0.16/0.25	YES(?,O(n^1))
0.16/0.25	
0.16/0.25	Problem:
0.16/0.25	 f(f(x)) -> f(c(f(x)))
0.16/0.25	 f(f(x)) -> f(d(f(x)))
0.16/0.25	 g(c(x)) -> x
0.16/0.25	 g(d(x)) -> x
0.16/0.25	 g(c(0())) -> g(d(1()))
0.16/0.25	 g(c(1())) -> g(d(0()))
0.16/0.25	
0.16/0.25	Proof:
0.16/0.25	 Bounds Processor:
0.16/0.25	  bound: 1
0.16/0.25	  enrichment: match
0.16/0.25	  automaton:
0.16/0.25	   final states: {6,5}
0.16/0.25	   transitions:
0.16/0.25	    g1(11) -> 12*
0.16/0.25	    d1(10) -> 11*
0.16/0.25	    01() -> 13*
0.16/0.25	    11() -> 10*
0.16/0.25	    f0(2) -> 5*
0.16/0.25	    f0(4) -> 5*
0.16/0.25	    f0(1) -> 5*
0.16/0.25	    f0(3) -> 5*
0.16/0.25	    c0(2) -> 1*
0.16/0.25	    c0(4) -> 1*
0.16/0.25	    c0(1) -> 1*
0.16/0.25	    c0(3) -> 1*
0.16/0.25	    d0(2) -> 2*
0.16/0.25	    d0(4) -> 2*
0.16/0.25	    d0(1) -> 2*
0.16/0.25	    d0(3) -> 2*
0.16/0.25	    g0(2) -> 6*
0.16/0.25	    g0(4) -> 6*
0.16/0.25	    g0(1) -> 6*
0.16/0.25	    g0(3) -> 6*
0.16/0.25	    00() -> 3*
0.16/0.25	    10() -> 4*
0.16/0.25	    1 -> 6*
0.16/0.25	    2 -> 6*
0.16/0.25	    3 -> 6*
0.16/0.25	    4 -> 6*
0.16/0.25	    10 -> 12,6
0.16/0.25	    12 -> 6*
0.16/0.25	    13 -> 10*
0.16/0.25	  problem:
0.16/0.25	   
0.16/0.25	  Qed
0.16/0.25	EOF