YES(?,O(n^1))

Problem:
 0(0(0(0(x1)))) -> 1(0(1(1(x1))))
 1(0(0(1(x1)))) -> 0(0(0(0(x1))))

Proof:
 Bounds Processor:
  bound: 0
  enrichment: match
  automaton:
   final states: {3,2}
   transitions:
    00(1) -> 2*
    10(1) -> 3*
    f40() -> 1*
  problem:
   
  Qed