{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:06Z","timestamp":1725471306876},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_21","type":"book-chapter","created":{"date-parts":[[2006,9,28]],"date-time":"2006-09-28T14:49:15Z","timestamp":1159454955000},"page":"259-273","source":"Crossref","is-referenced-by-count":2,"title":["On Learning Languages from Positive Data and a Limited Number of Short Counterexamples"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Efim","family":"Kinber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","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":"21_CR2","unstructured":"B\u0101rzdi\u0146\u0161, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs, vol.\u00a01, pp. 82\u201388. Latvian State University (1974) (in Russian)"},{"issue":"5","key":"21_CR3","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":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"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.) ICALP 1982. LNCS, vol.\u00a0140, pp. 107\u2013115. Springer, Heidelberg (1982)"},{"key":"21_CR5","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":"21_CR6","volume-title":"Bounded Queries in Recursion Theory","author":"W. Gasarch","year":"1998","unstructured":"Gasarch, W., Martin, G.: Bounded Queries in Recursion Theory. Birkhauser, Basel (1998)"},{"key":"21_CR7","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":"21_CR8","unstructured":"Jain, S., Kinber, E.: On learning languages from positive data and a limited number of short counterexamples. Technical Report TR21\/05, School of Computing, National University of Singapore (2005)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ic.2005.09.001","volume":"204","author":"S. Jain","year":"2006","unstructured":"Jain, S., Kinber, E.: Learning languages from positive data and a finite number of queries. Information and Computation\u00a0204, 123\u2013175 (2006)","journal-title":"Information and Computation"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Jain, S., Kinber, E.: Learning languages from positive data and negative counterexamples. Journal of Computer and System Sciences (to appear, 2006)","DOI":"10.1007\/11776420_21"},{"key":"21_CR11","series-title":"LNAI","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":"21_CR12","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)"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(91)90176-I","volume":"39","author":"T. Motoki","year":"1991","unstructured":"Motoki, T.: Inductive inference from all positive and some negative data. Information Processing Letters\u00a039(4), 177\u2013182 (1991)","journal-title":"Information Processing Letters"},{"key":"21_CR14","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":"#cr-split#-21_CR15.1","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967);"},{"key":"#cr-split#-21_CR15.2","unstructured":"Reprinted by MIT Press in (1987)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/09528139408953785","volume":"6","author":"R. Wiehagen","year":"1994","unstructured":"Wiehagen, R., Zeugmann, T.: Ignoring data be the only way to learn efficiently. Journal of Experimental and Theoretical Artificial Intelligence\u00a06, 131\u2013144 (1994)","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"key":"21_CR17","series-title":"LNAI","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: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS (LNAI), vol.\u00a0961, pp. 190\u2013258. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11776420_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:06:52Z","timestamp":1605643612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11776420_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540352945","9783540352969"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11776420_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}