Polynomial-time identification of very simple grammars from positive data-Reference-Cited by-同舟云学术

Polynomial-time identification of very simple grammars from positive data

Published:2003-04 Issue:1 Volume:298 Page:179-206
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Yokomori Takashi

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference24 articles.

1. Inductive inference of formal languages from positive data;Angluin;Inform. and Control,1980

2. Inference of reversible languages;Angluin;J. ACM,1982

3. Learning regular sets from queries and counterexamples;Angluin;Inform. and Comput.,1987

4. Negative results for equivalence queries;Angluin;Mach. Learning,1990

5. Une famille de congruences de thue pour lesquelles le probleme de l'equivalence est decidable. application a l'equivalence des grammaires separees;Butzbach,1973

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Extracting automata from recurrent neural networks using queries and counterexamples (extended version);Machine Learning;2022-06-08

2. Grammatical inference of directed acyclic graph languages with polynomial time complexity;Journal of Computer and System Sciences;2018-08

3. Computational Learning of Syntax;Annual Review of Linguistics;2017-01-14

4. Polynomial Time Learner for Inferring Subclasses of Internal Contextual Grammars with Local Maximum Selectors;Theoretical Aspects of Computing – ICTAC 2017;2017

5. Grammatical Inference of PCFGs Applied to Language Modelling and Unsupervised Parsing;Fundamenta Informaticae;2016-09-30