Learning Regular Tree Languages from Correction and Equivalence Queries

Inspired by the results obtained in the string case, we present in this paper the extension of the correction queries to regular tree languages. Relying on Angluin's and Sakakibara's work, we introduce the algorithm LRTLC and we show that regular tree languages are learnable from equivalence and correction queries when the set of contexts is ordered by a Knuth-Bendix order. Moreover, a subclass of regular tree languages, called injective languages, is learned without equivalence queries. This can be extended for other subclasses and may have some practical relevance in fields like machine translation, pattern and speech recognition, building XML documents.

[1]  Yasubumi Sakakibara,et al.  Learning context-free grammars from structural data in polynomial time , 1988, COLT '88.

[2]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[3]  James Jay Horning,et al.  A study of grammatical inference , 1969 .

[4]  Lillian Lee,et al.  Learning of Context-Free Languages: A Survey of the Literature , 1996 .

[5]  Frank Drewes,et al.  Query Learning of Regular Tree Languages: How to Avoid Dead States , 2005, Theory of Computing Systems.

[6]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[7]  Frank Drewes,et al.  Learning a Regular Tree Language from a Teacher , 2003, Developments in Language Theory.

[8]  E. Mark Gold,et al.  Language Identification in the Limit , 1967, Inf. Control..

[9]  Leonor Becerra-Bonache,et al.  Learning DFA from Correction and Equivalence Queries , 2006, ICGI.

[10]  King-Sun Fu,et al.  Syntactic Methods in Pattern Recognition , 1974, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  J. Humphrys,et al.  Beyond Words , 2006 .

[12]  Aravind K. Joshi,et al.  Skeletal Structural Descriptions , 1978, Inf. Control..

[13]  Peter Lammich,et al.  Tree Automata , 2009, Arch. Formal Proofs.