{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:44:35Z","timestamp":1725486275727},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433385"},{"type":"electronic","value":"9783540458845"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45884-0_12","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T22:06:11Z","timestamp":1180908371000},"page":"201-213","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Refutable\/Inductive Learning from Neighbor Examples and Its Application to Decision Trees over Patterns"],"prefix":"10.1007","author":[{"given":"Masako","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuhito","family":"Mukouchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikiharu","family":"Terada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"12_CR1","unstructured":"D. Angluin: Finding patterns common to a set of strings, in Proceedings of the Eleventh Annual Symposium on Theory of Computing (1979) 130\u2013141."},{"key":"12_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"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF03037183","volume":"11","author":"S. Arikawa","year":"1993","unstructured":"S. Arikawa, S. Kuhara, S. Miyano, Y. Mukouchi, Y. Shinohara and T. Shinohara: A machine discovery from amino acid sequences by decision trees over regular patterns, New Generation Computing 11(3,4) (1993) 361\u2013375.","journal-title":"New Generation Computing"},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","first-page":"646","volume-title":"Proceedings of the Eleventh Symposium on Theoretical Aspects of Computer Science","author":"H. Arimura","year":"1994","unstructured":"H. Arimura, T. Shinohara and S. Otsuki: Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data, in Proceedings of the Eleventh Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 775 (1994) 646\u2013660."},{"key":"12_CR5","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":"12_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00207168108803224","volume":"9","author":"A. Gabrielian","year":"1981","unstructured":"A. Gabrielian: Pure grammars and pure languages, International Journal of Computer Mathematics 9 (1981) 3\u201316.","journal-title":"International Journal of Computer Mathematics"},{"key":"12_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":"E.M. Gold: Language identification in the limit, Information and Control 10 (1967) 447\u2013474.","journal-title":"Information and Control"},{"key":"12_CR8","volume-title":"Coding and Information Theory","author":"R. Hamming","year":"1982","unstructured":"R. Hamming: \u201cCoding and Information Theory,\u201d Prentice Hall, englewood Cliffs, NJ (1982)."},{"key":"12_CR9","unstructured":"S. Jain: Program synthesis in the presence of infinite number of inaccuracies, in Proceedings of the Fifth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 872 (1994) 333\u2013348."},{"key":"12_CR10","unstructured":"S. Jain: Learning with refutation, in Proceedings of the Ninth International Conference on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1501 (1998) 291\u2013305."},{"key":"12_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":"12_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":"12_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":"12_CR14","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0022-5193(71)90002-6","volume":"21","author":"A. Lindenmayer","year":"1971","unstructured":"A. Lindenmayer: Developmental systems for cellular interactions, their languages and grammars, Journal of Theoretical Biology 21 (1971) 455\u2013484.","journal-title":"Journal of Theoretical Biology"},{"key":"12_CR15","unstructured":"S. Miyano: Learning theory towards Genome informatics, in Proceedings of the Fourth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744 (1993) 19\u201336."},{"key":"12_CR16","unstructured":"T. Moriyama and M. Sato: Properties of language classes with finite elasticity, in Proceedings of the Fourth International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744 (1993) 187\u2013196."},{"key":"12_CR17","unstructured":"T. Motoki, T. Shinohara and K. Wright: The correct definition of finite elasticity: corrigendum to identification of unions, in Proceedings of the Fourth Annual ACM Workshop on Computational Learning Theory (1991) 375\u2013375."},{"key":"12_CR18","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":"12_CR19","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"},{"key":"12_CR20","unstructured":"Y. Mukouchi, I. Yamaue and S. Sato: Inferring a rewriting system from examples, in Proceedings of the First International Conference on Discovery Science, Lecture Notes in Artificial Intelligence 1532 (1998) 93\u2013104."},{"issue":"3","key":"12_CR21","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":"12_CR22","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":"12_CR23","unstructured":"Y. Mukouchi and M. Sato: Refutable language learning with a neighbor system, to appear in Theoretical Computer Science."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Y. Sakakibara and R. Siromoney: A noise model on learning sets of strings, in Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory (1992) 295\u2013302.","DOI":"10.1145\/130385.130418"},{"issue":"1","key":"12_CR25","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. A. Wagner","year":"1974","unstructured":"R. A. Wagner and M. J. Fischer: The string-to-string correction problem, Journal of the ACM 21(1) (1974) 168\u2013173.","journal-title":"Journal of the ACM"},{"issue":"1","key":"12_CR26","doi-asserted-by":"crossref","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":"12_CR27","unstructured":"M. Sato, Y. Mukouchi and D. Zheng: Characteristic sets for unions of regular pattern languages and compactness, in Proceedings of the Ninth International Conference on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 1501 (1998) 220\u2013233."},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"M. Sato and Y. Mukouchi: Inductive inference of languages generated by regular pattern languages, in Proceedings of JSAI Meeting at Okinawa Convention Center (1999).","DOI":"10.3156\/jfuzzy.11.3_2"},{"key":"12_CR29","unstructured":"T. Shinohara: Polynomial time inference of pattern languages and its applications, in Proceedings of the Seventh IBM Symposium on Mathematical Foundations of Computer Sciences (1982) 191\u2013209."},{"issue":"3","key":"12_CR30","doi-asserted-by":"crossref","first-page":"67","DOI":"10.5109\/13368","volume":"21","author":"T. Shinohara","year":"1985","unstructured":"T. Shinohara: Inductive inference from negative data, Bulletin of Informatics and Cybernetics 21(3,4) (1985) 67\u201370.","journal-title":"Bulletin of Informatics and Cybernetics"},{"key":"12_CR31","unstructured":"F. Stephan: Noisy inference and oracles, in Proceedings of the Sixth International Workshop on Algorithmic Learning Theory, Lecture Notes on Artificial Intelligence 997 (1995) 185\u2013200."},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"R. M. Smullyan: \u201cElementary Formal Systems,\u201d Princeton University Press (1961).","DOI":"10.2969\/jmsj\/01310038"},{"key":"12_CR33","unstructured":"M. Terada, Y. Mukouchi and M. Sato: Inductive inference of decision trees over patterns from positive examples, Transactions of IEICE J83-D-I(1) 60\u201367, in Japanese."},{"key":"12_CR34","unstructured":"K. Wright: Identifition of unions of languages drawn from an identifile class, in Proceedings of the Second Annual ACM Workshop on Computational Learning Theory (1989) 328\u2013333."}],"container-title":["Lecture Notes in Computer Science","Progress in Discovery Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45884-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T04:44:28Z","timestamp":1683866668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45884-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433385","9783540458845"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-45884-0_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"14 March 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}