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	 f(h(x)) -> f(i(x))
0.16/0.22	 g(i(x)) -> g(h(x))
0.16/0.22	 h(a()) -> b()
0.16/0.22	 i(a()) -> b()
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: {7,8}
0.16/0.22	   transitions:
0.16/0.22	    b1() -> 30*
0.16/0.22	    g1(22) -> 23*
0.16/0.22	    h1(24) -> 25*
0.16/0.22	    h1(21) -> 22*
0.16/0.22	    f1(13) -> 14*
0.16/0.22	    i1(15) -> 16*
0.16/0.22	    i1(12) -> 13*
0.16/0.22	    f0(7) -> 7*
0.16/0.22	    f0(8) -> 7*
0.16/0.22	    h0(7) -> 7*
0.16/0.22	    h0(8) -> 7*
0.16/0.22	    i0(7) -> 7*
0.16/0.22	    i0(8) -> 7*
0.16/0.22	    g0(7) -> 7*
0.16/0.22	    g0(8) -> 7*
0.16/0.22	    a0() -> 8*
0.16/0.22	    b0() -> 7*
0.16/0.22	    7 -> 21,12
0.16/0.22	    8 -> 24,15
0.16/0.22	    14 -> 7*
0.16/0.22	    16 -> 13*
0.16/0.22	    23 -> 7*
0.16/0.22	    25 -> 22*
0.16/0.22	    30 -> 16,13,25,22,7
0.16/0.22	  problem:
0.16/0.22	   
0.16/0.22	  Qed
0.16/0.22	EOF