Inference of reversible tree languages.
In this paper, we study the notion of k-reversibility and k-testability when regular tree languages are involved. We present an inference algorithm for learning a k-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.
López
Damián
D
Departamento de Sistemas Informáticos y Computación, Universidad Politécnica of Valencia, 46071 Valencia, Spain. dlopez@dsic.upv.es
Sempere
José M
JM
García
Pedro
P
D000465:Algorithms; D001185:Artificial Intelligence; D009323:Natural Language Processing; D010363:Pattern Recognition, Automated; D012660:Semantics; D018875:Vocabulary, Controlled