YES
Trs:
 {   tail(cons(X, XS)) -> activate(XS),
               zeros() -> cons(0(), n__zeros()),
               zeros() -> n__zeros(),
  activate(n__zeros()) -> zeros(),
           activate(X) -> X}
 Comment:
  We consider a non-duplicating trs.
  BOUND:
   Automaton:
    {         0_3() -> q9,
              0_2() -> q7,
              0_1() -> q6,
              0_0() -> q5,
     cons_3(q9, q5) -> q5,
     cons_2(q7, q5) -> q5,
     cons_1(q6, q5) -> q5,
     cons_0(q5, q5) -> q5,
         tail_0(q5) -> q5,
       n__zeros_3() -> q5,
       n__zeros_2() -> q5,
       n__zeros_1() -> q5,
       n__zeros_0() -> q5,
          zeros_2() -> q5,
          zeros_1() -> q5,
          zeros_0() -> q5,
     activate_1(q5) -> q5,
     activate_0(q5) -> q5}
   Strict:
   {}
   Qed