YES(?,O(n^1))

Problem:
 0(0(*(*(x1)))) -> *(*(1(1(x1))))
 1(1(*(*(x1)))) -> 0(0(#(#(x1))))
 #(#(0(0(x1)))) -> 0(0(#(#(x1))))
 #(#(1(1(x1)))) -> 1(1(#(#(x1))))
 #(#($($(x1)))) -> *(*($($(x1))))
 #(#(#(#(x1)))) -> #(#(x1))
 #(#(*(*(x1)))) -> *(*(x1))

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