{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:07:26Z","timestamp":1767236846760},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578116"},{"type":"electronic","value":"9783540483373"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57811-0_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:24:43Z","timestamp":1330262683000},"page":"54-62","source":"Crossref","is-referenced-by-count":11,"title":["Learning behaviors of automata from multiplicity and equivalence queries"],"prefix":"10.1007","author":[{"given":"F.","family":"Bergadano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Varricchio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"6_CR1","unstructured":"A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms Addison-Wesley, 1974."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","volume":"39","author":"D. Angluin","year":"1978","unstructured":"D. Angluin. On the complexity of minimum inference of regular sets. Information and Control, 39:337\u2013350, 1978.","journal-title":"Information and Control"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D. Angluin","year":"1981","unstructured":"D. Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51:76\u201387, 1981.","journal-title":"Information and Control"},{"key":"6_CR4","doi-asserted-by":"crossref","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":"6_CR5","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121\u2013150, 1990.","journal-title":"Machine Learning"},{"key":"6_CR6","unstructured":"F. Bergadano and A. Giordana and L. Saitta. Machine Learning: an Integrated Framework and its Applications Ellis Horwood, 1991."},{"key":"6_CR7","unstructured":"F. Bergadano and D. Gunetti. An Interactive System to Learn Functional Logic Programs. Proc. Int. Joint Conf. on Artificial Intelligence, Morgan Kaufmann, 1993."},{"key":"6_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational series and their languages","author":"J. Berstel","year":"1988","unstructured":"J. Berstel and C. Reutenauer. Rational series and their languages Springer-Verlag, Berlin, 1988."},{"key":"6_CR9","volume-title":"Automata, Languages and Machines Vol. A","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg. Automata, Languages and Machines Vol. A, Academic Press, New York, 1974."},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"M. E. Gold","year":"1978","unstructured":"M. E. Gold. Complexity of automaton identification from given data. Information and Control, 37:302\u2013320, 1978.","journal-title":"Information and Control"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"T. Harju and J. Karhumaki. Decidability of the multiplicity equivalence problem of multitape finite automata Proc. 22nd STOC, 477\u2013481, (1990).","DOI":"10.1145\/100216.100281"},{"key":"6_CR12","unstructured":"B. K. Natarajan. Machine Learning: a Theoretical Approach Morgan Kaufmann, 1991."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/138027.138042","volume":"40","author":"L. Pitt","year":"1993","unstructured":"L. Pitt and M. K. Warmuth. The Minimum Consistent DFA Problem Cannot be Approximated within any Polynomial. Journal of the ACM, 40:95\u2013142, 1993.","journal-title":"Journal of the ACM"},{"key":"6_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata theoretic aspects of formal power series","author":"A. Salomaa","year":"1978","unstructured":"A. Salomaa and M. Soittola. Automata theoretic aspects of formal power series Springer-Verlag, New York, 1978."},{"issue":"3","key":"6_CR15","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/0214044","volume":"14","author":"R. E. Stearns","year":"1985","unstructured":"R. E. Stearns and H. B. Hunt. On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata SIAM J. Comput., 14:3,598\u2013611, 1985.","journal-title":"SIAM J. Comput."},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(92)90354-I","volume":"99","author":"S. Varricchio","year":"1992","unstructured":"S. Varricchio. On the decidability of the equivalence problem for partially commutative rational power series Theoretical Computer Science, 99: 291\u2013299, 1992.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57811-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:16Z","timestamp":1605647656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57811-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578116","9783540483373"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-57811-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}