Efficient learning of context-free grammars from positive structural examples
- 1 March 1992
- journal article
- Published by Elsevier in Information and Computation
- Vol. 97 (1), 23-60
- https://doi.org/10.1016/0890-5401(92)90003-x
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Queries and concept learningMachine Learning, 1988
- Learning regular sets from queries and counterexamplesInformation and Computation, 1987
- A theory of the learnableCommunications of the ACM, 1984
- Inference of Reversible LanguagesJournal of the ACM, 1982
- Inductive inference of formal languages from positive dataInformation and Control, 1980
- Skeletal structural descriptionsInformation and Control, 1978
- Noncounting Context-Free LanguagesJournal of the ACM, 1978
- On the Covering and Reduction Problems for Context-Free GrammarsJournal of the ACM, 1972
- Parenthesis GrammarsJournal of the ACM, 1967
- Language identification in the limitInformation and Control, 1967