{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T20:21:41Z","timestamp":1751660501799,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":19,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_194","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:05Z","timestamp":1214505305000},"page":"425-428","source":"Crossref","is-referenced-by-count":1,"title":["Learning Automata"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Bergadano","sequence":"additional","affiliation":[]},{"given":"Nader H.","family":"Bshouty","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Varricchio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"194_CR1_194","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. Inf. Comput. 75, 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"issue":"4","key":"194_CR2_194","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"key":"194_CR3_194","doi-asserted-by":"crossref","unstructured":"Beimel, A., Bergadano, F., Bshouty, N.H., Kushilevitz, E., Varricchio, S.: On the applications of multiplicity automata in learning. In: Proc. of the 37th Annu. IEEE Symp. on Foundations of Computer Science, pp. 349\u2013358, IEEE Comput. Soc. Press, Los Alamitos (1996)","DOI":"10.1109\/SFCS.1996.548494"},{"key":"194_CR4_194","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.\u00a0ACM 47, 506\u2013530 (2000)","journal-title":"J. ACM"},{"key":"194_CR5_194","doi-asserted-by":"crossref","unstructured":"Beimel, A., Kushilevitz, E.: Learning boxes in high dimension. In: Ben-David S. (ed.) 3rd European Conf. on Computational Learning Theory (EuroCOLT '97), Lecture Notes in Artificial Intelligence, vol.\u00a01208, pp.\u00a03\u201315. Springer, Berlin (1997) Journal version: Algorithmica 22, 76\u201390 (1998)","DOI":"10.1007\/PL00013835"},{"key":"194_CR6_194","first-page":"126","volume-title":"Proc. of the 28th Annu. ACM Symp. on the Theory of Computing","author":"F. Bergadano","year":"1996","unstructured":"Bergadano, F., Catalano, D., Varricchio, S.: Learning sat-k-DNF formulas from membership queries. In: Proc. of the 28th Annu. ACM Symp. on the Theory of Computing, pp.\u00a0126\u2013130. ACM Press, New York (1996)"},{"key":"194_CR7_194","doi-asserted-by":"crossref","unstructured":"Bergadano, F., Varricchio, S.: Learning behaviors of automata from multiplicity and equivalence queries. In: Proc. of 2nd Italian Conf. on Algorithms and Complexity. Lecture Notes in Computer Science, vol.\u00a0778, pp.\u00a054\u201362. Springer, Berlin (1994). Journal version: SIAM J. Comput. 25(6), 1268\u20131280 (1996)","DOI":"10.1007\/3-540-57811-0_6"},{"key":"194_CR8_194","first-page":"380","volume-title":"EuroCOLT '95, Lecture Notes in Artificial Intelligence, vol. 904","author":"F. Bergadano","year":"1996","unstructured":"Bergadano, F., Varricchio, S.: Learning behaviors of automata from shortest counterexamples. In: EuroCOLT '95, Lecture Notes in Artificial Intelligence, vol.\u00a0904, pp.\u00a0380\u2013391. Springer, Berlin (1996)"},{"key":"194_CR9_194","first-page":"184","volume-title":"Proc. of 19th Annu. ACM Conf. Comput. Learning Theory, Lecture Notes in Computer Science. vol. 4005","author":"L. Bisht","year":"2006","unstructured":"Bisht, L., Bshouty, N.H., Mazzawi, H.: On Optimal Learning Algorithms for Multiplicity Automata. In: Proc. of 19th Annu. ACM Conf. Comput. Learning Theory, Lecture Notes in Computer Science. vol. 4005, pp.\u00a0184\u2013198. Springer, Berlin (2006)"},{"key":"194_CR10_194","first-page":"110","volume-title":"Proc. of 7th Annu. ACM Conf. on Comput. Learning Theory","author":"A. Blum","year":"1994","unstructured":"Blum, A., Khardon, R., Kushilevitz, E., Pitt, L., Roth, D.: On learning read-k-satisfy-j DNF. In: Proc. of 7th Annu. ACM Conf. on Comput. Learning Theory, pp.\u00a0110\u2013117. ACM Press, New York (1994)"},{"key":"194_CR11_194","unstructured":"Bshouty, N.H.: Exact learning via the monotone theory. In: Proc. of the 34th Annu. IEEE Symp. on Foundations of Computer Science, pp.\u00a0302\u2013311. IEEE Comput. Soc. Press, Los Alamitos (1993). Journal version: Inform. Comput. 123(1), 146\u2013153 (1995)"},{"key":"194_CR12_194","doi-asserted-by":"crossref","unstructured":"Bshouty, N.H.: Simple learning algorithms using divide and conquer. In: Proc. of 8th Annu. ACM Conf. on Comput. Learning Theory, pp.\u00a0447\u2013453. ACM Press, New York (1995). Journal version: Computational Complexity, 6, 174\u2013194 (1997)","DOI":"10.1007\/BF01262930"},{"issue":"1\/2","key":"194_CR13_194","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 22(1\/2), 91\u2013111 (1998)","journal-title":"Algorithmica"},{"key":"194_CR14_194","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E.: A\u00a0simple algorithm for learning $$ { O(\\log n) } $$-term DNF. In: Proc. of 9th Annu. ACM Conf. on Comput. Learning Theory, pp 266\u2013269, ACM Press, New York (1996). Journal version: Inform. Process. Lett. 61(6), 289\u2013292 (1997)","DOI":"10.1016\/S0020-0190(97)00026-4"},{"issue":"6","key":"194_CR15_194","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevitz","year":"1993","unstructured":"Kushilevitz, E., Mansour, Y.: Learning decision trees using the Fourier spectrum. SIAM J. Comput. 22(6), 1331\u20131348 (1993)","journal-title":"SIAM J. Comput."},{"key":"194_CR16_194","first-page":"87","volume-title":"ALT '98. Lecture Notes in Computer Science, vol. 1501","author":"G. Melideo","year":"1998","unstructured":"Melideo, G., Varricchio, S.: Learning unary output two-tape automata from multiplicity and equivalence queries. In: ALT '98. Lecture Notes in Computer Science, vol.\u00a01501, pp.\u00a087\u2013102. Springer, Berlin (1998)"},{"issue":"5","key":"194_CR17_194","first-page":"1077","volume":"10)","author":"H. Ohnishi","year":"1994","unstructured":"Ohnishi, H., Seki, H., Kasami, T.: A\u00a0polynomial time learning algorithm for recognizable series. IEICE Transactions on Information and Systems, E77-D(10)(5), 1077\u20131085 (1994)","journal-title":"IEICE Transactions on Information and Systems, E77-D("},{"issue":"2","key":"194_CR18_194","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jcss.1996.0017","volume":"52","author":"R.E. Schapire","year":"1996","unstructured":"Schapire, R.E., Sellie, L.M.: Learning sparse multivariate polynomials over a\u00a0field with queries and counterexamples. J.\u00a0 Comput. Syst. Sci. 52(2), 201\u2013213 (1996)","journal-title":"J. Comput. Syst. Sci."},{"issue":"11","key":"194_CR19_194","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: A\u00a0theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:19Z","timestamp":1738272739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_194"}},"subtitle":["2000; Beimel, Bergadano, Bshouty, Kushilevitz, Varricchio"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_194","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}