“…On the other hand, if G is a full row rank matrix for all k and t C [0, nt], w(t, k) = 0, and there exists a positive constant cx0 such that x (0, k + 1)-x(O, k) < cxO, then there exist positive constants c1p and cr,, such that~( t, k + 1)-x(t, k) < c<k k i(t+,u,k) l2 < CV) and lim 0(t+p,k)= 0 k k-o where where the output error 309q(-,k) A Cq()[Xd() x(, k)] with 1 < q < m. U Proof The proof follows similar arguments that are presented in [14], thus, omitted. Remark 2.…”