{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:11Z","timestamp":1725471311484},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540352945"},{"type":"electronic","value":"9783540352969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11776420_16","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T14:49:15Z","timestamp":1159454955000},"page":"184-198","source":"Crossref","is-referenced-by-count":6,"title":["On Optimal Learning Algorithms for Multiplicity Automata"],"prefix":"10.1007","author":[{"given":"Laurence","family":"Bisht","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nader H.","family":"Bshouty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanna","family":"Mazzawi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation\u00a075(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"16_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1987)","journal-title":"Machine Learning"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s000370050028","volume":"8","author":"M. Bl\u00e4ser","year":"1999","unstructured":"Bl\u00e4ser, M.: Lower bounds for the multiplicative complexity of matrix multiplication. Comput. Complexity\u00a08(3), 203\u2013226 (1999)","journal-title":"Comput. Complexity"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/337244.337257","volume":"47","author":"A. Beimel","year":"2000","unstructured":"Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: Learning functions represented as multiplicity automata. J. ACM\u00a047(3), 506\u2013530 (2000)","journal-title":"J. ACM"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-62685-9_13","volume-title":"Computational Learning Theory","author":"F. Bergadano","year":"1997","unstructured":"Bergadano, F., Bshouty, N.H., Tamon, C., Varricchio, S.: On Learning Programs and Small Depth Circuits. In: Ben-David, S. (ed.) EuroCOLT 1997. LNCS, vol.\u00a01208, pp. 150\u2013161. Springer, Heidelberg (1997)"},{"unstructured":"Bergadano, F., Bshouty, N.H., Varricchio, S.: Learning Multivariate Polynomials from Substitution and Equivalence Queries (1996), \n                    \n                      http:\/\/www.eccc.uni-trier.de\/eccc","key":"16_CR6"},{"doi-asserted-by":"crossref","unstructured":"Bergadano, F., Catalano, D., Varricchio, S.: Learning Sat-k-DNF Formulas from Membership Queries. In: STOC 1996, pp. 126\u2013130 (1996)","key":"16_CR7","DOI":"10.1145\/237814.237845"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Learning Theory","author":"J.L. Balc\u00e1zar","year":"1993","unstructured":"Balc\u00e1zar, J.L., D\u00edaz, J., Gavald\u00e1, R., Watanabe, O.: A note on the query complexity of learning DFA. In: Doshita, S., Nishida, T., Furukawa, K., Jantke, K.P. (eds.) ALT 1992. LNCS, vol.\u00a0743. Springer, Heidelberg (1993)"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1006\/jcss.1996.0021","volume":"52","author":"N.H. Bshouty","year":"1996","unstructured":"Bshouty, N.H., Goldman, S.A., Hancock, T.R., Matar, S.: Asking Questions to Minimize Errors. J. Comput. Syst. Sci.\u00a052(2), 268\u2013286 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\/2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/PL00013835","volume":"22","author":"A. Beimel","year":"1998","unstructured":"Beimel, A., Kushilevitz, E.: Learning Boxes in High Dimension. Algorithmica\u00a022(1\/2), 76\u201390 (1998)","journal-title":"Algorithmica"},{"issue":"1\/2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/PL00013836","volume":"22","author":"N.H. Bshouty","year":"1998","unstructured":"Bshouty, N.H., Tamon, C., Wilson, D.K.: Learning matrix functions over rings. Algorithmica\u00a022(1\/2), 91\u2013111 (1998)","journal-title":"Algorithmica"},{"issue":"6","key":"16_CR12","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1137\/S009753979326091X","volume":"25","author":"F. Bergadano","year":"1996","unstructured":"Bergadano, F., Varricchio, S.: Learning Behaviors of Automata from Multiplicity and Equivalence Queries. SIAM J. Comput\u00a025(6), 1268\u20131280 (1996)","journal-title":"SIAM J. Comput"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/3-540-59119-2_193","volume-title":"Computational Learning Theory","author":"F. Bergadano","year":"1995","unstructured":"Bergadano, F., Varricchio, S.: Learning behaviors of automata from shortest counterexamples. In: Vit\u00e1nyi, P.M.B. (ed.) EuroCOLT 1995. LNCS, vol.\u00a0904, pp. 380\u2013391. Springer, Heidelberg (1995)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09, 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"unstructured":"Elkies, N.: On finite sequences satisfying linear recursions. Available at: \n                    \n                      http:\/\/xxx.lanl.gov\/abs\/math.CO\/0105007","key":"16_CR15"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Valiant, L.G.: Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. J. ACM\u00a041(1), 67\u201395 (1994)","journal-title":"J. ACM"},{"key":"16_CR17","first-page":"285","volume":"2","author":"N. Littlestone","year":"1987","unstructured":"Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning\u00a02, 285\u2013318 (1987)","journal-title":"Machine Learning"},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Information and Computation\u00a0108(2), 212\u2013261 (1994)","journal-title":"Information and Computation"},{"key":"16_CR19","first-page":"107","volume":"9","author":"W. Maass","year":"1992","unstructured":"Maass, W., Tur\u00e1n, G.: Lower bound methods and seperation results for on-line learning models. Machine Learning\u00a09, 107\u2013145 (1992)","journal-title":"Machine Learning"},{"issue":"5","key":"16_CR20","first-page":"1077","volume":"E77-D","author":"H. Ohnishi","year":"1994","unstructured":"Ohnishi, H., Seki, H., Kasami, T.: A polynomial time learning algorithm for recognizable series. IEICE Transactions on Information and Systems\u00a0E77-D(5), 1077\u20131085 (1994)","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"5","key":"16_CR21","doi-asserted-by":"publisher","first-page":"1185","DOI":"10.1137\/S0097539702405954","volume":"32","author":"A. Shpilka","year":"2003","unstructured":"Shpilka, A.: Lower Bounds for Matrix Product. SIAM J. Comput.\u00a032(5), 1185\u20131200 (2003)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:30Z","timestamp":1619507730000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11776420_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}