M Ghorani - Department of Mathematics, Alzahra University, Tehran, Iran
M.M Zahedi - Faculty of Mathematical Science, Tarbiat Modares University, Tehran, Iran
B.A Ghaznavi-ghosoni۳ - Faculty of Mathematics and Computer Science, Amirkabir University of Technology,

In this paper, we consider complete residuated lattice-valued nite tree automata (L-valued nite tree automata). In this note, after recalling some preliminaries related to complete residuated lattice and L-valued tree automata we de ne L-valued (regular) tree language and some unary L-valued predicates. Further, a pumping lemma for L-valued tree automata is obtained. Our pumping lemma extends the pumping lemma obtained for L-valued automata

Tree automata, Pumping lemma, L-valued tree language