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	 p(f(f(x))) -> q(f(g(x)))
0.16/0.22	 p(g(g(x))) -> q(g(f(x)))
0.16/0.22	 q(f(f(x))) -> p(f(g(x)))
0.16/0.22	 q(g(g(x))) -> p(g(f(x)))
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: {5}
0.16/0.22	   transitions:
0.16/0.22	    p1(21) -> 22*
0.16/0.22	    g1(15) -> 16*
0.16/0.22	    g1(10) -> 11*
0.16/0.22	    f1(14) -> 15*
0.16/0.22	    f1(11) -> 12*
0.16/0.22	    q1(12) -> 13*
0.16/0.22	    p0(5) -> 5*
0.16/0.22	    f0(5) -> 5*
0.16/0.22	    q0(5) -> 5*
0.16/0.22	    g0(5) -> 5*
0.16/0.22	    5 -> 14,10
0.16/0.22	    12 -> 21*
0.16/0.22	    13 -> 5*
0.16/0.22	    16 -> 12*
0.16/0.22	    22 -> 5*
0.16/0.22	  problem:
0.16/0.22	   
0.16/0.22	  Qed
0.16/0.23	EOF