YES(?,O(n^1))
0.16/0.21	YES(?,O(n^1))
0.16/0.21	
0.16/0.21	Problem:
0.16/0.21	 f(a(),x) -> g(a(),x)
0.16/0.21	 g(a(),x) -> f(b(),x)
0.16/0.21	 f(a(),x) -> f(b(),x)
0.16/0.21	
0.16/0.21	Proof:
0.16/0.21	 Bounds Processor:
0.16/0.21	  bound: 2
0.16/0.21	  enrichment: match
0.16/0.21	  automaton:
0.16/0.21	   final states: {5}
0.16/0.21	   transitions:
0.16/0.21	    f1(8,5) -> 5*
0.16/0.21	    b1() -> 8*
0.16/0.21	    g1(7,5) -> 5*
0.16/0.21	    a1() -> 7*
0.16/0.21	    f2(9,5) -> 5*
0.16/0.21	    f0(5,5) -> 5*
0.16/0.21	    b2() -> 9*
0.16/0.21	    a0() -> 5*
0.16/0.21	    g0(5,5) -> 5*
0.16/0.21	    b0() -> 5*
0.16/0.21	  problem:
0.16/0.21	   
0.16/0.21	  Qed
0.16/0.22	EOF