The equivalence and inclusion problems for NTS languages
Journal of Computer and System Sciences
NTS languages are deterministic and congruential
Journal of Computer and System Sciences
Learning regular sets from queries and counterexamples
Information and Computation
Grammatical interface for even linear languages based on control sets
Information Processing Letters
Negative Results for Equivalence Queries
Machine Learning
A quasi-polynomial-time algorithm for sampling words from a context-free language
Information and Computation
Inference of Reversible Languages
Journal of the ACM (JACM)
Deciding the NTS Property of Context-Free Grammars
Proceedings of the Colloquium in Honor of Arto Salomaa on Results and Trends in Theoretical Computer Science
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Polynomial Identification in the Limit of Substitutable Context-free Languages
The Journal of Machine Learning Research
A Polynomial Algorithm for the Inference of Context Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
A bibliographical study of grammatical inference
Pattern Recognition
Zulu: an interactive learning competition
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
A learnable representation for syntax using residuated lattices
FG'09 Proceedings of the 14th international conference on Formal grammar
The tenjinno machine translation competition
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms 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
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
Using Contextual Representations to Efficiently Learn Context-Free Languages
The Journal of Machine Learning Research
Distributional learning of abstract categorial grammars
LACL'11 Proceedings of the 6th international conference on Logical aspects of computational linguistics
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
A language theoretic approach to syntactic structure
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Distributional learning of simple context-free tree grammars
ALT'11 Proceedings of the 22nd international conference on Algorithmic learning theory
Integration of the dual approaches in the distributional learning of context-free grammars
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Logical grammars, logical theories
LACL'12 Proceedings of the 7th international conference on Logical Aspects of Computational Linguistics
Polynomial time learning of some multiple context-free languages with a minimally adequate teacher
FG'10/FG'11 Proceedings of the 15th and 16th international conference on Formal Grammar
Four one-shot learners for regular tree languages and their polynomial characterizability
Theoretical Computer Science
| Hi-index | 0.00 |
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) showed that some context free grammars can be identified in the limit from positive data alone by identifying the congruence classes of the language. In this paper we consider learnability of context free languages using a MAT. We show that there is a natural class of context free languages, that includes the class of regular languages, that can be polynomially learned from a MAT, using an algorithm that is an extension of Angluin's LSTAR algorithm.