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	 f(a()) -> f(b())
0.16/0.20	 g(b()) -> g(a())
0.16/0.20	 f(x) -> g(x)
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: {5}
0.16/0.20	   transitions:
0.16/0.20	    g1(10) -> 11*
0.16/0.20	    g1(16) -> 17*
0.16/0.20	    a1() -> 10*
0.16/0.20	    f1(8) -> 9*
0.16/0.20	    b1() -> 8*
0.16/0.20	    g2(22) -> 23*
0.16/0.20	    f0(5) -> 5*
0.16/0.20	    a2() -> 26*
0.16/0.20	    a0() -> 5*
0.16/0.20	    b0() -> 5*
0.16/0.20	    g0(5) -> 5*
0.16/0.20	    5 -> 16*
0.16/0.20	    8 -> 22*
0.16/0.20	    9 -> 5*
0.16/0.20	    11 -> 17,5
0.16/0.20	    17 -> 5*
0.16/0.20	    23 -> 9,5
0.16/0.20	    26 -> 22*
0.16/0.20	  problem:
0.16/0.20	   
0.16/0.20	  Qed
0.16/0.20	EOF