{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:12Z","timestamp":1759639032094},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_47","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T18:30:43Z","timestamp":1330281043000},"page":"298-312","source":"Crossref","is-referenced-by-count":13,"title":["On approximately identifying concept classes in the limit"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Kobayashi","sequence":"first","affiliation":[]},{"given":"Takashi","family":"Yokomori","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"23_CR1","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, vol. 45, pp.117\u2013135, 1980","journal-title":"Information and Control"},{"key":"23_CR2","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, pp.97\u2013113, 1992","journal-title":"Theoretical Computer Science"},{"key":"23_CR3","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. Mark Gold. Language identification in the limit. Information and Control, vol. 10, pp.447\u2013474, 1967","journal-title":"Information and Control"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/S0021-9800(69)80111-0","volume":"6","author":"L. H. Haines","year":"1969","unstructured":"L. H. Haines. On Free Monoids Partially Ordered by Embedding, Journal of Combinatorial Theory, 6, pp.94\u201398, 1969","journal-title":"Journal of Combinatorial Theory"},{"issue":"No.1","key":"23_CR5","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1016\/0890-5401(92)90010-D","volume":"100","author":"D. Haussler","year":"1992","unstructured":"D. Haussler. Decisin Theoretic Generalizations of the PAC model for Neural Net and Other Learning Applications. Information and Computation, Vol. 100, No. 1, pp.78\u2013150, 1992","journal-title":"Information and Computation"},{"key":"23_CR6","first-page":"210","volume":"95","author":"J. B. Kruskal","year":"1960","unstructured":"J. B. Kruskal. Well-Quasi-Ordering, the Tree Theorem and Vazsonyi's Conjecture. Trans. Amer. Math. Soc., 95, pp.210\u2013225, 1960 (May)","journal-title":"Trans. Amer. Math. Soc."},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0097-3165(72)90063-5","volume":"13","author":"J. B. Kruskal","year":"1972","unstructured":"J. B. Kruskal. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept. Journal of Combinatorial Theory (A), 13, pp.297\u2013305, 1972","journal-title":"Journal of Combinatorial Theory (A)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"M. J. Kearns, R. E. Schapire and L. M. Sellie. Toward Efficient Agnostic Learning, Proc. of 5th Annual Workshop on Computational Learning Theory, pp.341\u2013351, 1992","DOI":"10.1145\/130385.130424"},{"key":"23_CR9","unstructured":"S. Kobayashi. and T. Yokomori. Families of Noncounting Languages and Its Learnability from Positive Data. Technical Report CSIM 94-03, University of Electro-Communications, September, 1994"},{"key":"23_CR10","unstructured":"S. Kobayashi and T. Yokomori. An Extended Rough Set Theory Toward Approximate Learning of Formal Languages. Proc. of International Workshop on Rough Sets and Soft Computing, pp.482\u2013489, 1994"},{"key":"23_CR11","unstructured":"S. Kobayashi and T. Yokomori. Some Characterizations of Approximately Identifiable Language Classes. Technical Report CSIM 94-06, Department of Computer Science and Information Mathematics, University of Electro-Communications, December, 1994"},{"key":"23_CR12","first-page":"187","volume":"744","author":"T. Moriyama","year":"1993","unstructured":"T. Moriyama and M. Sato. Properties of Language Classes with Finite Elasticity. Proc. 4th Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744, pp.187\u2013196, 1993.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"T. Motoki, T. Shinohara and K. Wright. The correct definition of finite elasticity: corrigendum to identification of unions. Proc. of 4th Workshop on Computational Learning Theory, pp.375\u2013375, 1991","DOI":"10.1016\/B978-1-55860-213-7.50037-7"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Y. Mukouchi and S. Arikawa. Inductive Inference Machines That Can Refute Hypothesis Spaces. Proc. of 4th Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744, Springer-Verlag, pp. 123\u2013136, 1993","DOI":"10.1007\/3-540-57370-4_42"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Y. Mukouchi. Inductive Inference of an Approximate Concept from Positive Data, in Proc. of 5th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 872, Springer-Verlag, pp.484\u2013499, 1994","DOI":"10.1007\/3-540-58520-6_85"},{"key":"23_CR16","unstructured":"A. Sakurai. Inductive Inference of Formal Languages from Positive Data Enumerated Primitive-Recursively, Proc. of 2nd Workshop on Algorithmic Learning Theory, pp.73\u201383, 1991"},{"key":"23_CR17","unstructured":"M. Sato and T. Moriyama. Inductive Inference of Length Bounded EFS's from Positive Data, in preparation, 1993"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data. Kulwer Academic Publishers, 1991","DOI":"10.1007\/978-94-011-3534-4"},{"issue":"No.4","key":"23_CR19","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"L. Pitt and L. G. Valiant. Computational Limitations on Learning from Examples, Journal of the ACM, Vol. 35, No. 4, pp.965\u2013984, October 1988","journal-title":"Journal of the ACM"},{"key":"23_CR20","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, pp.175\u2013186, 1994","journal-title":"Information and Computation"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"R. M. Smullyan. Theory of Formal Systems. Princeton Univ. Press, 1961","DOI":"10.1515\/9781400882007"},{"issue":"No.11","key":"23_CR22","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant. A Theory of the Learnable, Communications of the ACM, Vol. 27, No. 11, pp.1134\u20131142, November 1984","journal-title":"Communications of the ACM"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"K. Wright. Identification of unions of languages drawn from an identifiable class. Proc. of 2nd Workshop on Computational Learning Theory, pp.328\u2013333, 1989","DOI":"10.1016\/B978-0-08-094829-4.50026-X"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:59:25Z","timestamp":1605646765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}