Learning regular sets from queries and counterexamples
Information and Computation
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Term rewriting and all that
Handbook of Formal Languages
Query Learning of Regular Tree Languages: How to Avoid Dead States
Theory of Computing Systems
Learning a regular tree language from a teacher
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Learning DFA from correction and equivalence queries
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
On Learning Regular Expressions and Patterns Via Membership and Correction Queries
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A Note on the Relationship between Different Types of Correction Queries
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
MAT learners for recognizable tree languages and tree series
Acta Cybernetica
| Hi-index | 0.00 |
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.