{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:45:14Z","timestamp":1725486314719},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540416951"},{"type":"electronic","value":"9783540446934"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44693-1_25","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T05:10:18Z","timestamp":1181625018000},"page":"283-293","source":"Crossref","is-referenced-by-count":4,"title":["Learning Expressions over Monoids"],"prefix":"10.1007","author":[{"given":"Ricard","family":"Gavald\u00e0","sequence":"first","affiliation":[]},{"given":"Denis","family":"Th\u00e9rien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87\u2013106, 1987.","journal-title":"Information and Computation"},{"key":"25_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1995.1026","volume":"50","author":"D. Angluin","year":"1995","unstructured":"D. Angluin and M. Kharitonov. When won\u2019t membership queries help? Journal of Computer and System Sciences, 50:336\u2013355, 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D. Barrington","year":"1989","unstructured":"D. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences, 38:150\u2013164, 1989.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0890-5401(90)90007-5","volume":"89","author":"D. M. Barrington","year":"1990","unstructured":"D. M. Barrington, H. Straubing, and D. Th\u00e9rien. Non-uniform automata over groups. Information and Computation, 89:109\u2013132, 1990.","journal-title":"Information and Computation"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1145\/48014.63138","volume":"35","author":"D. M. Barrington","year":"1988","unstructured":"D. M. Barrington and D. Th\u00e9rien. Finite monoids and the fine structure of NC1. Journal of the ACM, 35:941\u2013952, 1988.","journal-title":"Journal of the ACM"},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1145\/146637.146661","volume":"39","author":"M. Beaudry","year":"1992","unstructured":"M. Beaudry, P. McKenzie, and D. Th\u00e9rien. The membership problem in aperiodic transformation monoids. Journal of the ACM, 39(3):599\u2013616, 1992.","journal-title":"Journal of the ACM"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/337244.337257","volume":"47","author":"A. Beimel","year":"2000","unstructured":"A. Beimel, F. Bergadano, N. Bshouty, E. Kushilevitz, and S. Varricchio. Learning functions represented as multiplicity automata. Journal of the ACM, 47:506\u2013530, 2000.","journal-title":"Journal of the ACM"},{"key":"25_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-62685-9_13","volume-title":"Proc. 3rd European Conference on Computational Learning Theory (EuroCOLT\u201997)","author":"F. Bergadano","year":"1997","unstructured":"F. Bergadano, N. Bshouty, C. Tamon, and S. Varricchio. On learning branching programs and small depth circuits. Proc. 3rd European Conference on Computational Learning Theory (EuroCOLT\u201997), Springer-Verlag LNCS, 1208:150\u2013161, 1997."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1137\/S009753979326091X","volume":"25","author":"F. Bergadano","year":"1996","unstructured":"F. Bergadano and S. Varricchio. Learning behaviors of automata from multiplicity and equivalence queries. SIAM Journal on Computing, 25:1268\u20131280, 1996.","journal-title":"SIAM Journal on Computing"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1006\/jcss.1996.0032","volume":"52","author":"N. Bshouty","year":"1996","unstructured":"N. Bshouty, R. Cleve, R. Gavald\u00e1, S. Kannan, and C. Tamon. Oracles and queries that are sufficient for exact learning. Journal of Computer and System Sciences, 52:421\u2013433, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/PL00013836","volume":"22","author":"N. Bshouty","year":"1998","unstructured":"N. Bshouty, C. Tamon, and D. Wilson. Learning matrix functions over rings. Algorithmica, 22:91\u2013111, 1998.","journal-title":"Algorithmica"},{"key":"25_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BFb0055038","volume-title":"Proc. ICALP\u201998","author":"J.-F. Raymond","year":"1998","unstructured":"J.-F. Raymond, P. Tesson, and D. Th\u00e9rien. An algebraic approach to communication complexity. Proc. ICALP\u201998, Springer-Verlag LNCS, 1443:29\u201340, 1998."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02194921","volume":"13","author":"M. Sch\u00fctzenberger","year":"1976","unstructured":"M. Sch\u00fctzenberger. Sur le produit de concat\u00e9nation non ambigu. Semigroup Forum, 13:47\u201375, 1976.","journal-title":"Semigroup Forum"},{"issue":"3","key":"25_CR15","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0304-3975(89)90051-0","volume":"64","author":"D. Th\u00e9rien","year":"1989","unstructured":"D. Th\u00e9rien. Programs over aperiodic monoids. Theoretical Computer Science, 64(3):271\u2013280, 29 1989.","journal-title":"Theoretical Computer Science"},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"L. Valiant. A theory of the learnable. Communications of the ACM, 27:1134\u20131142, 1984.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","STACS 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44693-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T09:17:27Z","timestamp":1550395047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44693-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540416951","9783540446934"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44693-1_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}