{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:18:12Z","timestamp":1725549492550},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_30","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"360-371","source":"Crossref","is-referenced-by-count":1,"title":["Learning Languages from Positive Data and a Finite Number of Queries"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[]},{"given":"Efim","family":"Kinber","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"30_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"Angluin, D., Hellerstein, L., Karpinski, M.: Learning read-once formulas with queries. Journal of the ACM\u00a040(1), 185\u2013210 (1993)","journal-title":"Journal of the ACM"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and System Sciences\u00a021, 46\u201362 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR3","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 counter-examples. Information and Computation\u00a075, 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"30_CR4","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"30_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-45583-3_3","volume-title":"Algorithmic Learning Theory","author":"D. Angluin","year":"2001","unstructured":"Angluin, D.: Queries revisited. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol.\u00a02225, pp. 12\u201331. Springer, Heidelberg (2001)"},{"key":"30_CR6","unstructured":"B\u0101rzdi\u0146\u0161, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs, Latvian State University, vol.\u00a01, pp. 82\u201388 (1974) (in Russian)"},{"issue":"5","key":"30_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1006\/jcss.1995.1066","volume":"51","author":"G. Baliga","year":"1995","unstructured":"Baliga, G., Case, J., Jain, S.: Language learning with some negative information. Journal of Computer and System Sciences\u00a051(5), 273\u2013285 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Proceedings of the 9th International Colloquium on Automata, Languages and Programming","author":"J. Case","year":"1982","unstructured":"Case, J., Lynes, C.: Machine inductive inference and language identification. In: Nielsen, M., Schmidt, E.M. (eds.) Proceedings of the 9th International Colloquium on Automata, Languages and Programming. LNCS, vol.\u00a0140, pp. 107\u2013115. Springer, Heidelberg (1982)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science\u00a025, 193\u2013220 (1983)","journal-title":"Theoretical Computer Science"},{"key":"30_CR10","volume-title":"Bounded Queries in Recursion Theory","author":"W. Gasarch","year":"1998","unstructured":"Gasarch, W., Martin, G.: Bounded Queries in Recursion Theory. Birkh\u00e4user, Basel (1998)"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"30_CR12","first-page":"337","volume-title":"Proceedings of the Workshop on Computational Learning Theory","author":"O. Ibarra","year":"1988","unstructured":"Ibarra, O., Jiang, T.: Learning regular languages from counterexamples. In: Proceedings of the Workshop on Computational Learning Theory, pp. 337\u2013351. Morgan Kaufmann, San Francisco (1988)"},{"key":"30_CR13","volume-title":"Algorithmic Learning Theory: Fifteenth International Conference ALT 2004","author":"S. Jain","year":"2004","unstructured":"Jain, S., Kinber, E.: Learning language from positive data and negative counterexamples. In: Algorithmic Learning Theory: Fifteenth International Conference ALT 2004, Springer, Heidelberg (2004);(to appear)"},{"key":"30_CR14","unstructured":"Jain, S., Kinber, E.: Learning languages from positive data and finite number of queries. Technical Report TRC4\/04, School of Computing, National University of Singapore (2004)"},{"key":"30_CR15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that Learn: An Introduction to Learning Theory","author":"S. Jain","year":"1999","unstructured":"Jain, S., Osherson, D., Royer, J., Sharma, A.: Systems that Learn: An Introduction to Learning Theory, vol.\u00a02. MIT Press, Cambridge (1999)"},{"key":"30_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-56004-1_16","volume-title":"Analogical and Inductive Inference, Proceedings of the Third International Workshop","author":"E. Kinber","year":"1992","unstructured":"Kinber, E.: Learning a class of regular expressions via restricted subset queries. In: Jantke, K. (ed.) Analogical and Inductive Inference, Proceedings of the Third International Workshop. LNCS (LNAI), vol.\u00a0642, pp. 232\u2013243. Springer, Heidelberg (1992)"},{"key":"30_CR17","unstructured":"Lange, S., Nessel, J., Zilles, S.: Learning languages with queries. In: Proceedings of Treffen der GI-Fachgruppe Maschinelles Lernen (FGML), Learning Lab Lower Saxony, Hannover, Germany, pp. 92\u201399 (2002)"},{"key":"30_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-540-30215-5_9","volume-title":"Algorithmic Learning Theory","author":"S. Lange","year":"2004","unstructured":"Lange, S., Zilles, S.: Comparison of query learning and gold-style learning in dependence of the hypothesis space. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol.\u00a03244, pp. 99\u2013113. Springer, Heidelberg (2004)"},{"key":"30_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-27819-1_11","volume-title":"Learning Theory","author":"S. Lange","year":"2004","unstructured":"Lange, S., Zilles, S.: Replacing limit learners with equally powerful one-shot query learners. In: Shawe-Taylor, J., Singer, Y. (eds.) COLT 2004. LNCS (LNAI), vol.\u00a03120, pp. 155\u2013169. Springer, Heidelberg (2004)"},{"key":"30_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/3-540-40992-0_7","volume-title":"Algorithmic Learning Theory","author":"J. Nessel","year":"2000","unstructured":"Nessel, J., Lange, S.: Learning erasing pattern languages with queries. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol.\u00a01968, pp. 86\u2013100. Springer, Heidelberg (2000)"},{"key":"30_CR21","volume-title":"Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D. Osherson","year":"1986","unstructured":"Osherson, D., Stob, M., Weinstein, S.: Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge (1986)"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","volume":"52","author":"D. Osherson","year":"1982","unstructured":"Osherson, D., Weinstein, S.: Criteria of language learning. Information and Control\u00a052, 123\u2013138 (1982)","journal-title":"Information and Control"},{"key":"30_CR23","volume-title":"Theory of Recursive Functions and Effective Computability.","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967); Reprinted by MIT Press in 1987"},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(02)00417-6","volume":"298","author":"H. Sakamoto","year":"2003","unstructured":"Sakamoto, H., Hirata, K., Arimura, H.: Learning elementary formal systems with queries. Theoretical Computer Science A\u00a0298, 21\u201350 (2003)","journal-title":"Theoretical Computer Science A"},{"key":"30_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-60217-8_12","volume-title":"Algorithmic Learning for Knowledge-Based Systems","author":"T. Zeugmann","year":"1995","unstructured":"Zeugmann, T., Lange, S.: A guided tour across the boundaries of learning recursive languages. In: Jantke, K., Lange, S. (eds.) Algorithmic Learning for Knowledge-Based Systems. LNCS (LNAI), vol.\u00a0961, pp. 190\u2013258. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:51Z","timestamp":1605761931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}