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	 p(f(f(x))) -> q(f(g(x)))
0.16/0.23	 p(g(g(x))) -> q(g(f(x)))
0.16/0.23	 q(f(f(x))) -> p(f(g(x)))
0.16/0.23	 q(g(g(x))) -> p(g(f(x)))
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	    p1(27) -> 28*
0.16/0.23	    g1(15) -> 16*
0.16/0.23	    g1(5) -> 6*
0.16/0.23	    g1(18) -> 19*
0.16/0.23	    f1(25) -> 26*
0.16/0.23	    f1(17) -> 18*
0.16/0.23	    f1(6) -> 7*
0.16/0.23	    q1(7) -> 8*
0.16/0.23	    p0(2) -> 3*
0.16/0.23	    p0(1) -> 3*
0.16/0.23	    f0(2) -> 1*
0.16/0.23	    f0(1) -> 1*
0.16/0.23	    q0(2) -> 4*
0.16/0.23	    q0(1) -> 4*
0.16/0.23	    g0(2) -> 2*
0.16/0.23	    g0(1) -> 2*
0.16/0.23	    1 -> 25,15
0.16/0.23	    2 -> 17,5
0.16/0.23	    7 -> 27*
0.16/0.23	    8 -> 3*
0.16/0.23	    16 -> 6*
0.16/0.23	    19 -> 7*
0.16/0.23	    26 -> 18*
0.16/0.23	    28 -> 4*
0.16/0.23	  problem:
0.16/0.23	   
0.16/0.23	  Qed
0.16/0.23	EOF