Abstract—In this paper, we study the notion of-reversibility and-testability when regular tree languages are involved. We present an inference algorithm for learning a-testable tree language that runs in polynomial time with respect to the size of the sample used. We also study the tree language classes in relation to other well known ones, and some properties of these languages are proven. Index Terms—Grammatical inference, pattern recognition, regular tree languages. I.