YES(?,O(n^1))

Problem:
 f(f(x)) -> g(f(x))

Proof:
 RT Transformation Processor:
  strict:
   f(f(x)) -> g(f(x))
  weak:
   
  Bounds Processor:
   bound: 1
   enrichment: match-rt
   automaton:
    final states: {3}
    transitions:
     g1(8) -> 9*
     f1(7) -> 8*
     f0(3) -> 3*
     g0(3) -> 3*
     3 -> 7*
     9 -> 8,3
   problem:
    strict:
     
    weak:
     f(f(x)) -> g(f(x))
   Qed