YES
O(n)
TRS:
 {     g(a()) -> g(b()),
          b() -> f(a(), a()),
  f(a(), a()) -> g(d())}
 DUP: We consider a non-duplicating system.
  Trs:
   {     g(a()) -> g(b()),
            b() -> f(a(), a()),
    f(a(), a()) -> g(d())}
  BOUND:
   Automaton:
    {
           d_3() -> 15,
           d_2() -> 11,
           d_1() -> 6,
           d_0() -> 5,
     f_2(13, 13) -> 6,
       f_1(9, 9) -> 5,
       f_0(5, 5) -> 5,
           a_2() -> 13,
           a_1() -> 9,
           a_0() -> 5,
           b_1() -> 6,
           b_0() -> 5,
         g_3(15) -> 6,
         g_2(11) -> 5,
          g_1(6) -> 5,
          g_0(5) -> 5
    }
   Strict:
    {}
   Qed