YES
O(n)
TRS:
 {
               zeros() -> cons(0(), n__zeros()),
               zeros() -> n__zeros(),
           activate(X) -> X,
  activate(n__zeros()) -> zeros(),
     tail(cons(X, XS)) -> activate(XS)
 }
 DUP: We consider a non-duplicating system.
  Trs:
   {
                 zeros() -> cons(0(), n__zeros()),
                 zeros() -> n__zeros(),
             activate(X) -> X,
    activate(n__zeros()) -> zeros(),
       tail(cons(X, XS)) -> activate(XS)
   }
  BOUND:
   Automaton:
    {
         tail_0(6) -> 6,
     activate_1(6) -> 6,
     activate_0(6) -> 6,
         zeros_2() -> 6,
         zeros_1() -> 6,
         zeros_0() -> 6,
      n__zeros_3() -> 6,
      n__zeros_2() -> 6,
      n__zeros_1() -> 6,
      n__zeros_0() -> 6,
             0_3() -> 9,
             0_2() -> 8,
             0_1() -> 7,
             0_0() -> 6,
      cons_3(9, 6) -> 6,
      cons_2(8, 6) -> 6,
      cons_1(7, 6) -> 6,
      cons_0(6, 6) -> 6
    }
   Strict:
    {}
   Qed