Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher-Reference-Cited by-同舟云学术

Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher

Published:2010 Issue: Volume: Page:24-37
ISSN:0302-9743
Container-title:Grammatical Inference: Theoretical Results and Applications
language:
Short-container-title:

Author:

Clark Alexander

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15488-1_4.pdf

Reference19 articles.

1. Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research 8, 1725–1745 (2007)

2. Angluin, D.: Inference of reversible languages. Communications of the ACM 29, 741–765 (1982)

3. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)

4. Lecture Notes in Artificial Intelligence;A. Clark,2008

5. Shirakawa, H., Yokomori, T.: Polynomial-time MAT Learning of C-Deterministic Context-free Grammars. Transactions of the information processing society of Japan 34, 380–390 (1993)

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

1. “Synthesizing input grammars”: a replication study;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09

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

3. Learning Pomset Automata;Lecture Notes in Computer Science;2021

4. Improving Quality of Data Exchange Files. An Industrial Case Study;Product-Focused Software Process Improvement;2019

5. Supercombinator set acquired from context-free grammar samples;Computer Languages, Systems & Structures;2018-12