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
On the learnability of infinitary regular sets
Information and Computation
Learning non-deterministic finite automata from queries and counterexamples
Machine intelligence 13
Characteristic Sets for Polynomial Grammatical Inference
Machine Learning
Algorithmic Program DeBugging
Machine Learning
Machine Learning
Learning Regular Languages Using RFSA
ALT '01 Proceedings of the 12th International Conference on Algorithmic Learning Theory
Formal language identification: query learning vs. gold-style learning
Information Processing Letters
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
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Relations between Gold-style learning and query learning
Information and Computation
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Learning a regular tree language from a teacher
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Grammatical Inference: Learning Automata and Grammars
Grammatical Inference: Learning Automata and Grammars
Distributional learning of some context-free languages with a minimally adequate teacher
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Learning context free grammars with the syntactic concept lattice
ICGI'10 Proceedings of the 10th international colloquium conference on Grammatical inference: theoretical results and applications
Towards general algorithms for grammatical inference
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Towards dual approaches for learning context-free grammars based on syntactic concept lattices
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Distributional learning of simple context-free tree grammars
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Residual Finite State Automata
Fundamenta Informaticae
| Hi-index | 5.23 |
We survey two existing algorithms for the inference of finite-state tree automata from membership queries and a finite positive sample or equivalence queries, and we suggest a reformulation of one of them which we deem necessary to ensure its termination. We present two algorithms for the same two settings when the underlying description is not a deterministic but a residual canonical finite-state automaton. To this end, we adapt all necessary notions to the residual tree case. From our completed perspective, we discuss the terms on which those four algorithms can be considered to be of polynomial complexity, and also where there may be hidden exponentiality.