Inductive inference, DFAs, and computational complexity-Reference-Cited by-同舟云学术

Inductive inference, DFAs, and computational complexity

Published:1989 Issue: Volume: Page:18-44
ISSN:0302-9743
Container-title:Analogical and Inductive Inference
language:
Short-container-title:

Author:

Pitt Leonard

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-51734-0_50.pdf

Reference59 articles.

1. N. Abe. Polynomial learnability as a formal model of natural language acquisition. 1989. Ph.D. Thesis, in preparation, Department of Computer and Information Science, University of Pennsylvania.

2. N. Abe. Polynomial learnability of semilinear sets. In Proceedings of the 1989 Workshop on Computational Learning Theory, Morgan Kaufmann, San Mateo, CA, August 1989.

3. W. Alexi, B. Chor, O. Goldreich, and C. P. Schnorr. RSA and Rabin functions: certain parts are as hard as the whole. S.I.A.M. Journal on Computing, 17(2):194–209, 1988.

4. D. Angluin. Equivalence queries and approximate fingerprints. In Proceedings of the 1989 Workshop on Computational Learning Theory, Morgan Kaufmann, San Mateo, CA, August 1989.

5. D. Angluin. Inference of reversible languages. J. ACM, 29(3):741–765, 1982.

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

1. Regular grammar prediction from finite positive samples;AIP Conference Proceedings;2024

2. A mathematical characterization of minimally sufficient robot brains;The International Journal of Robotics Research;2023-09-19

3. Ingredients for Responsible Machine Learning: A Commented Review of The Hitchhiker’s Guide to Responsible Machine Learning;Journal of Statistical Theory and Applications;2022-09-15

4. Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms;Lecture Notes in Computer Science;2022

5. Learning Finite Automata with Shuffle;Advances in Knowledge Discovery and Data Mining;2021