{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:37Z","timestamp":1725664417014},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540618638"},{"type":"electronic","value":"9783540707196"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61863-5_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:29:22Z","timestamp":1330277362000},"page":"285-298","source":"Crossref","is-referenced-by-count":3,"title":["Vacillatory and BC learning on noisy data"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D. (1980), Inductive inference of formal languages from positive data, Information and Control 45, pp. 117\u2013135.","journal-title":"Information and Control"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"Angluin, D., and Smith, C.H. (1983), Inductive inference: theory and methods, Computing Surveys 15, pp. 237\u2013269.","journal-title":"Computing Surveys"},{"key":"25_CR3","volume-title":"Synthesizing enumeration techniques for language learning","author":"G. Baliga","year":"1996","unstructured":"Baliga, G., J. Case, and S. Jain. (1996), Synthesizing enumeration techniques for language learning. In Proceedings of the Ninth Annual Conference on Computational Learning Theory, Desenzano del Garda, Italy. ACM Press, July."},{"doi-asserted-by":"crossref","unstructured":"Baliga, G., Jain, S., and Sharma, A. (1992), Learning from Multiple Sources of Inaccurate Data, in \u201cProceedings of the International Workshop on Analogical and Inductive Inference in Dagstuhl Castle, Germany\u201d, October 1992, pp. 108\u2013128.","key":"25_CR4","DOI":"10.1007\/3-540-56004-1_8"},{"key":"25_CR5","first-page":"82","volume-title":"Theory of Algorithms and Programs","author":"J. Barzdin","year":"1974","unstructured":"Barzdin, J. (1974), Two Theorems on the Limiting Synthesis of Functions, in \u201cTheory of Algorithms and Programs\u201d (in Russian), Latvian State University, Riga, 210, pp. 82\u201388."},{"key":"25_CR6","first-page":"1224","volume":"13","author":"J. Barzdin","year":"1972","unstructured":"Barzdin, J. and Freivalds, R. (1972), On the prediction of general recursive functions. 13:1224\u20131228.","journal-title":"On the prediction of general recursive functions"},{"unstructured":"Barzdin, J., and Podnieks, K. (1973), The Theory of Inductive Inference, in \u201cProceedings of the Mathematical Foundations of Computer Science\u201d, Mathematical Institute of the Slovak Academy of Sciences, p. 9\u201315.","key":"25_CR7"},{"key":"25_CR8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1074.001.0001","volume-title":"The Acquisition of Syntactic Knowledge","author":"R. Berwick","year":"1985","unstructured":"Berwick, R. The Acquisition of Syntactic Knowledge. MIT Press, Cambridge, MA, 1985."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"M. Blum","year":"1975","unstructured":"Blum, M., and Blum, L. (1975), Towards a mathematical theory of inductive inference, Information and Control, 28, pp. 125\u2013155.","journal-title":"Information and Control"},{"key":"25_CR10","first-page":"196","volume-title":"The power of vacillation","author":"J. Case","year":"1988","unstructured":"Case, J. (1988) The power of vacillation, \u201cProceedings of the 1st Annual ACM Conference on Computational Learning Theory\u201d, Morgan Kaufmann Publishers, San Mateo, California, pp. 196\u2013205."},{"key":"25_CR11","volume-title":"Technical Report 93-08","author":"J. Case","year":"1992","unstructured":"Case, J. (1992), The power of vacillation in language learning. Technical Report 93-08, University of Delaware. Expands on [10]; journal version revised for possible publication."},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0022-0000(05)80046-7","volume":"49","author":"J. Case","year":"1994","unstructured":"Case, J., Jain, S., and Sharma, A. (1994), Vacillatory Learning of Nearly Minimal Size Grammars, Journal of Computer and System Sciences, 49, 189\u2013207.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/inco.1995.1013","volume":"116","author":"J. Case","year":"1995","unstructured":"Case, J., Jain, S., and Sharma, A. (1995), Complexity Issues for Vacillatory Function Identification, Information and Computation, 116, 174\u2013192.","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Case, J., Kaufmann, S., Kinber, E., and Kummer, M. (1995), Learning Recursive Functions From Approximations, in, \u201cProceedings of the European Conference on Computational Learning Theory (EuroCOLT)\u201d, Springer-Verlag, 140\u2013153.","key":"25_CR14","DOI":"10.1007\/3-540-59119-2_174"},{"doi-asserted-by":"crossref","unstructured":"Case, J., and Lynes, C. (1982), Inductive inference and language identification, in \u201cProceedings of the International Colloquium on Automata, Languages and Programming (ICALP)\u201d, Springer-Verlag, 107\u2013115.","key":"25_CR15","DOI":"10.1007\/BFb0012761"},{"key":"25_CR16","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., and Smith, C. (1983), Comparison of Identification Criteria for Machine Inductive Inference, Theoretical Computer Science 25, 193\u2013220.","journal-title":"Theoretical Computer Science"},{"key":"25_CR17","first-page":"175","volume-title":"Learning in the presence of inaccurate information","author":"M. Fulk","year":"1989","unstructured":"Fulk, M., and Jain, S. (1989), Learning in the presence of inaccurate information, in \u201cProceedings of the 2nd Annual ACM Conference on Computational Learning Theory,\u201d Santa Cruz, July 1989, pp. 175\u2013188, Morgan Kaufmann Publishers."},{"key":"25_CR18","first-page":"214","volume-title":"Learning via Queries to an Oracle","author":"W. Gasarch","year":"1989","unstructured":"Gasarch, W., and Pleszkoch, M. (1989), Learning via Queries to an Oracle, in \u201cProceedings of the 2nd Annual ACM Conference on Computational Learning Theory\u201d, Morgan Kaufman, Los Altos, California, pp. 214\u2013229."},{"key":"25_CR19","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. (1967), Language identification in the limit, Information and Control 10, pp. 447\u2013474.","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"Kapur, S. and Bilardi, G. (1992), Language learning without overgeneralization. In Proceedings of the Ninth Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 577.","key":"25_CR20","DOI":"10.1007\/3-540-55210-3_188"},{"doi-asserted-by":"crossref","unstructured":"Kapur S., B. Lust, W. Harbert, and G. Martohardjono. (1993), Universal grammar and learnability theory: The case of binding domains and the 'subset principle'. In E. Reuland and W. Abraham, editors, Knowledge and Language, volume I, pages 185\u2013216. Kluwer.","key":"25_CR21","DOI":"10.1007\/978-94-011-1840-8_9"},{"key":"25_CR22","first-page":"254","volume":"659","author":"S. Lange","year":"1993","unstructured":"Lange, S. and Zeugmann, T. (1993), Monotonic versus non-monotonic language learning. In Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic, pages 254\u2013269. Lecture Notes in Artificial Intelligence, 659.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"25_CR23","first-page":"377","volume-title":"Types of monotonic language learning and their characterization","author":"S. Lange","year":"1992","unstructured":"Lange, S., and Zeugmann, T. (1992), Types of monotonic language learning and their characterization, in Proceedings of the 5th Annual ACM Conference on Computational Learning Theory, Pittsburgh, July, pp. 377\u2013390, ACM Press, New York."},{"key":"25_CR24","volume-title":"A preliminary version appeared as GOSLER-Report 14\/94","author":"S. Lange","year":"1992","unstructured":"Lange, S., Zeugmann, T., and Kapur, S. (1992), Monotonic and dual monotonic language learning, to appear in Theoretical Computer Science. A preliminary version appeared as GOSLER-Report 14\/94, TH Leipzig, FB Mathematik und Informatik, August 1992."},{"doi-asserted-by":"crossref","unstructured":"Mukouchi, Y. (1992), Characterization of finite identification. In K. P. Jantke, editor, Proceedings of the Third International Workshop on Analogical and Inductive Inference, Dagstuhl Castle, Germany, pages 260\u2013267, October.","key":"25_CR25","DOI":"10.1007\/3-540-56004-1_18"},{"key":"25_CR26","volume-title":"Classical Recursion Theory","author":"P. Odifreddi","year":"1989","unstructured":"Odifreddi, P. (1989), \u201cClassical Recursion Theory\u201d, North-Holland, Amsterdam."},{"key":"25_CR27","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., and Weinstein, S. (1986), \u201cSystems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists,\u201d MIT-Press, Cambridge, Massachusetts."},{"key":"25_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R. Soare","year":"1987","unstructured":"Soare, R. (1987), Recursively Enumerable Sets and Degrees, Springer-Verlag, Heidelberg."},{"unstructured":"Stephan, F. (1995), Noisy Inference and Oracles, in \u201cProceedings of the 6th International Workshop on Algorithmic Learning Theory (ALT)\u201d, Springer-Verlag, Lecture Notes on Artificial Intelligence 997, pp. 185\u2013200.","key":"25_CR29"},{"doi-asserted-by":"crossref","unstructured":"Wexler, K. (1993), The subset principle is an intensional principle. In E. Reuland and W. Abraham, editors, Knowledge and Language, volume I, pages 217\u2013239. Kluwer.","key":"25_CR30","DOI":"10.1007\/978-94-011-1840-8_10"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61863-5_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:11:14Z","timestamp":1605629474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61863-5_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618638","9783540707196"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-61863-5_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}