{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:40Z","timestamp":1725664960794},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635772"},{"type":"electronic","value":"9783540696025"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63577-7_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:32:13Z","timestamp":1330299133000},"page":"197-211","source":"Crossref","is-referenced-by-count":0,"title":["Inferring a system from examples with time passage"],"prefix":"10.1007","author":[{"given":"Yasuhito","family":"Mukouchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"14_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.: Inductive inference of formal languages from positive data, Information and Control 45 (1980) 117\u2013135.","journal-title":"Information and Control"},{"key":"14_CR2","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 10 (1967) 447\u2013474.","journal-title":"Information and Control"},{"key":"14_CR3","volume-title":"Introduction to automata theory, languages and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E. and Ullman, J.D.: \u201cIntroduction to automata theory, languages and computation,\u201d Addison-Wesley Co. Inc. Reading, 1979."},{"key":"14_CR4","unstructured":"Kapur, S.: Computational learning of languages, PhD thesis, Technical Report 91-1234, Cornell University, 1991."},{"key":"14_CR5","unstructured":"Kapur, S.: Monotonic language learning, in Proceedings of the 3rd Workshop on Algorithmic Learning Theory (1992), Lecture Notes in Artificial Intelligence 743 (1993) 147\u2013158."},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Lange, S. and Zeugmann, T.: Types of monotonic language learning and their characterization, in Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory (1992) 377\u2013390.","DOI":"10.1145\/130385.130427"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Motoki, T, Shinohara, T. and Wright, K.: The correct definition of finite elasticity: corrigendum to identification of unions, in Proceedings of the 4th Annual ACM Workshop on Computational Learning Theory (1991) 375\u2013375.","DOI":"10.1016\/B978-1-55860-213-7.50037-7"},{"key":"14_CR8","unstructured":"Mukouchi, Y.: Characterization of finite identification, in Proceedings of the 3rd International Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence 642 (1992) 260\u2013267."},{"key":"14_CR9","unstructured":"Mukouchi, Y. and Arikawa, S.: Inductive inference machines that can refute hypothesis spaces, in Proceedings of the 4th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744 (1993) 123\u2013137."},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(95)91135-D","volume":"137","author":"Y. Mukouchi","year":"1995","unstructured":"Mukouchi, Y. and Arikawa, S.: Towards a mathematical theory of machine discovery from facts, Theoretical Computer Science 137 (1995) 53\u201384.","journal-title":"Theoretical Computer Science"},{"key":"14_CR11","unstructured":"Sato, M. and Moriyama, T.: Inductive inference of length-bounded EFS's from positive data, DMIS Research Report 94-2, Osaka Prefecture University, 1994."},{"key":"14_CR12","unstructured":"Sato, M. and Umayahara, K.: Inductive inferability for formal languages from positive data, in Proceedings of the 2nd Workshop on Algorithmic Learning Theory (1991) 84\u201392 (also in IEICE Trans. Inf. & Syst. E75-D No. 4 (1992) 415\u2013419)."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Wright, K.: Identification of unions of languages drawn from an identifiable class, in Proceedings of the 2nd Annual Workshop on Computational Learning Theory (1989) 328\u2013333","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-63577-7_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:44:43Z","timestamp":1619574283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63577-7_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635772","9783540696025"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-63577-7_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}