{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:35:46Z","timestamp":1742992546285,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45583-3_21","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"267-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Refutable Language Learning with a Neighbor System"],"prefix":"10.1007","author":[{"given":"Yasuhito","family":"Mukouchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masako","family":"Sato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin: Finding patterns common to a set of strings, Journal of Computer and System Sciences 21 (1980) 46\u201362.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"D. Angluin: Inductive inference of formal languages from positive data, Information and Control 45 (1980) 117\u2013135.","journal-title":"Information and Control"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.2206\/kyushumfs.24.47","volume":"24","author":"S. Arikawa","year":"1970","unstructured":"S. Arikawa: Elementary formal systems and formal languages-simple formal systems, Memoirs of Faculty of Science, Kyushu University, Series A, Math. 24 (1970) 47\u201375.","journal-title":"Memoirs of Faculty of Science, Kyushu University, Series A, Math."},{"key":"21_CR4","unstructured":"S. Arikawa, T. Shinohara and A. Yamamoto: Elementary formal systems as a unifying framework for language learning, in Proceedings of the Second Annual ACM Workshop on Computational Learning Theory (1989) 312\u2013327."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(92)90068-Q","volume":"95","author":"S. Arikawa","year":"1992","unstructured":"S. Arikawa, T. Shinohara and A. Yamamoto: Learning elementary formal systems, Theoretical Computer Science 95 (1992) 97\u2013113.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum: A machine independent theory of the complexity of the recursive functions, Journal of the Association for Computing Machinery 14(2) (1967) 322\u2013336.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"21_CR7","unstructured":"J. Case and S. Jain: Synthesizing learners tolerant computable noisy data, in Proceedings of the Ninth International Conference on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1501 (1998) 205\u2013219."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. M. Gold","year":"1967","unstructured":"E. M. Gold: Language identification in the limit, Information and Control 10 (1967) 447\u2013474.","journal-title":"Information and Control"},{"issue":"3","key":"21_CR9","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1006\/jcss.1996.0089","volume":"53","author":"S. Jain","year":"1996","unstructured":"S. Jain: Program synthesis in the presence of infinite number of inaccuracies, Journal of Computer and System Sciences 53(3) (1996) 583\u2013591.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/jcss.1998.1591","volume":"57","author":"S. Jain","year":"1998","unstructured":"S. Jain: Learning with refutation, Journal of Computer and System Sciences 57(3) (1998) 356\u2013365.","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR11","unstructured":"S. Kobayashi and T. Yokomori: On approximately identifying concept classes in the limit, in Proceedings of the Sixth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 997 (1995) 298\u2013312."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"S. Lange and T. Zeugmann: Types of monotonic language learning and their characterization, in Proceedings of the Fifth Annual ACMWorkshop on Computational Learning Theory (1992) 377\u2013390.","DOI":"10.1145\/130385.130427"},{"key":"21_CR13","unstructured":"S. Lange and P. Watson: Machine discovery in the presence of incomplete or ambiguous data, in Proceedings of the Fifth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 872 (1994) 438\u2013452."},{"key":"21_CR14","unstructured":"Y. Mukouchi: Characterization of finite identification, in Proceedings of the Third International Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence 642 (1992) 260\u2013267."},{"key":"21_CR15","unstructured":"Y. Mukouchi and S. Arikawa: Inductive inference machines that can refute hypothesis spaces, in Proceedings of the Fourth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744 (1993) 123\u2013136."},{"key":"21_CR16","unstructured":"Y. Mukouchi: Inductive inference of an approximate concept from positive data, in Proceedings of the Fifth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 872 (1994) 484\u2013499."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(95)91135-D","volume":"137","author":"Y. Mukouchi","year":"1995","unstructured":"Y. Mukouchi and S. Arikawa: Towards a mathematical theory of machine discovery from facts, Theoretical Computer Science 137 (1995) 53\u201384.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"21_CR18","first-page":"363","volume":"49","author":"Y. Mukouchi","year":"1999","unstructured":"Y. Mukouchi: Refutable inference with a restricted target class, Mathematica Japonica 49(3) (1999) 363\u2013372.","journal-title":"Mathematica Japonica"},{"key":"21_CR19","unstructured":"Y. Mukouchi and M. Sato: Language learning with a neighbor system, in Proceedings of the Third International Conference on Discovery Science, Lecture Notes in Artificial Intelligence 1967 (2000) 183\u2013196."},{"key":"21_CR20","unstructured":"H. Rogers Jr.: \u201cTheory of recursive functions and effective computability,\u201d McGraw-Hill, 1967."},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.5109\/13444","volume":"27","author":"M. Sato","year":"1995","unstructured":"M. Sato: Inductive inference of formal languages, Bulletin of Informatics and Cybernetics 27(1) (1995) 85\u2013106.","journal-title":"Bulletin of Informatics and Cybernetics"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1994.1006","volume":"108","author":"T. Shinohara","year":"1994","unstructured":"T. Shinohara: Rich classes inferable from positive data: length-bounded elementary formal systems, Information and Computation 108 (1994) 175\u2013186.","journal-title":"Information and Computation"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"R. M. Smullyan: \u201cTheory of formal systems,\u201d Princeton University Press, 1961.","DOI":"10.1515\/9781400882007"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(97)00018-2","volume":"185","author":"F. Stephan","year":"1997","unstructured":"F. Stephan: Noisy inference and oracles, Theoretical Computer Science 185 (1997) 129\u2013157.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"21_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0743-1066(92)90022-U","volume":"13","author":"A. Yamamoto","year":"1992","unstructured":"A. Yamamoto: Procedural semantics and negative information of elementary formal system, Journal of Logic Programming 13(4) (1992) 89\u201398.","journal-title":"Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T12:46:35Z","timestamp":1684068395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}