Author:
Bisht Laurence,Bshouty Nader H.,Mazzawi Hanna
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)
2. Angluin, D.: Queries and concept learning. Machine Learning 2, 319–342 (1987)
3. Bläser, M.: Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complexity 8(3), 203–226 (1999)
4. Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM 47(3), 506–530 (2000)
5. Lecture Notes in Computer Science;F. Bergadano,1997
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Almost Optimal Proper Learning and Testing Polynomials;LATIN 2022: Theoretical Informatics;2022
2. Hankel Matrices for Weighted Visibly Pushdown Automata;Language and Automata Theory and Applications;2016
3. Learning Automata;Encyclopedia of Algorithms;2016
4. Learning Weighted Automata;Algebraic Informatics;2015
5. Learning Automata;Encyclopedia of Algorithms;2015