Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Negative Results for Equivalence Queries
Machine Learning
Learning context-free grammars from structural data in polynomial time
Theoretical Computer Science
Efficient learning of context-free grammars from positive structural examples
Information and Computation
The inference of tree languages from finite samples: an algebraic approach
Theoretical Computer Science
On the learnability and usage of acyclic probabilistic finite automata
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Recent advances of grammatical inference
Theoretical Computer Science - Special issue on algorithmic learning theory
Algorithmic Program DeBugging
Machine Learning
Machine Learning
Learning Stochastic Finite Automata from Experts
ICGI '98 Proceedings of the 4th International Colloquium on Grammatical Inference
Inferring stochastic regular grammars with recurrent neural networks
ICG! '96 Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences
Learning Tree Languages from Text
COLT '02 Proceedings of the 15th Annual Conference on Computational Learning Theory
Computational Complexity of Problems on Probabilistic Grammars and Transducers
ICGI '00 Proceedings of the 5th International Colloquium on Grammatical Inference: Algorithms and Applications
Query Learning of Regular Tree Languages: How to Avoid Dead States
Theory of Computing Systems
Learning tree languages from positive examples and membership queries
Theoretical Computer Science
Learning deterministically recognizable tree series
Journal of Automata, Languages and Combinatorics
Handbook of Weighted Automata
A bibliographical study of grammatical inference
Pattern Recognition
The myhill-nerode theorem for recognizable tree series
DLT'03 Proceedings of the 7th international conference on Developments in language theory
A characterization of the language classes learnable with correction queries
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Learning deterministically recognizable tree series: revisited
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Learning regular tree languages from correction and equivalence queries
Journal of Automata, Languages and Combinatorics
Learning rational stochastic languages
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Using pseudo-stochastic rational languages in probabilistic grammatical inference
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning multiplicity tree automata
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning DFA from correction and equivalence queries
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Inference of reversible tree languages
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A randomised inference algorithm for regular tree languages
Natural Language Engineering
| Hi-index | 0.00 |
We review a family of closely related query learning algorithms for unweighted and weighted tree automata, all of which are based on adaptations of the minimal adequate teacher (MAT) model by Angluin. Rather than presenting new results, the goal is to discuss these algorithms in sufficient detail to make their similarities and differences transparent to the reader interested in grammatical inference of tree automata.