{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:41:29Z","timestamp":1743075689173,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"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_25","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"332-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extending Elementary Formal Systems"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Lange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunter","family":"Grieser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus P.","family":"Jantke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"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":"D. Angluin, Inductive inference of formal languages from positive data, Information and Control 45 (1980) 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":"D. Angluin, C. H. Smith, A survey of inductive inference: Theory and methods, Computing Surveys 15 (1983) 237\u2013269.","journal-title":"Computing Surveys"},{"key":"25_CR3","first-page":"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, Mathematics 24 (1970) 47\u201375.","journal-title":"Elementary formal systems and formal languages-Simple formal systems"},{"key":"25_CR4","first-page":"405","volume":"E75-D 4","author":"S. Arikawa","year":"1992","unstructured":"S. Arikawa, S. Miyano, A. Shinohara, T. Shinohara, A. Yamamoto, Algorithmic learning theory with elementary formal systems, IEICE Trans. Inf. & Syst. E75-D 4 (1992) 405\u2013414.","journal-title":"IEICE Trans. Inf. & Syst."},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"S. Arikawa, T. Shinohara, A. Yamamoto, Elementary formal systems as a unifying framework for language learning, in: Proc. Second Annual Workshop on Computational Learning Theory, Morgan Kaufmann, 1989, pp. 312\u2013327.","DOI":"10.1016\/B978-0-08-094829-4.50025-8"},{"key":"25_CR6","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, A. Yamamoto, Learning elementary formal systems, Theoretical Computer Science 95 (1992) 97\u2013113.","journal-title":"Theoretical Computer Science"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Hausler, M. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, Journal of the ACM 36 (1989) 929\u2013965.","journal-title":"Journal of the ACM"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"G. Grieser, K. P. Jantke, S. Lange, B. Thomas, A unifying approach to HTML wrapper representation and learning, in: Proc. Third Int. Conference on Discovery Science, LNAI 1967, Springer-Verlag, 2000, pp. 50\u201364.","DOI":"10.1007\/3-540-44418-1_5"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"14","author":"E. M. Gold","year":"1967","unstructured":"E. M. Gold, Language identification in the limit, Information and Control 14 (1967) 447\u2013474.","journal-title":"Information and Control"},{"key":"25_CR10","unstructured":"J. E. Hopcroft, J. D. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley Publishing Company, 1979."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"S. Jain, D. Osherson, J. Royer, A. Sharma, Systems that Learn-2nd Edition, An Introduction to Learning Theory, MIT Press, 1999.","DOI":"10.7551\/mitpress\/6610.001.0001"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0004-3702(99)00100-9","volume":"118","author":"N. Kushmerick","year":"2000","unstructured":"N. Kushmerick, Wrapper induction: efficiency and expressiveness, Artificial Intelligence 118 (2000) 15\u201368.","journal-title":"Artificial Intelligence"},{"key":"25_CR13","unstructured":"V. Lifschitz, Foundations of logic programming, in: Principles of knowledge representation, G. Brewka (ed.), CSLI Publications, 1996, pp. 69\u2013127."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF03037530","volume":"18","author":"S. Miyano","year":"2000","unstructured":"S. Miyano, A. Shinohara, T. Shinohara, Polynomial-time learning of elementary formal systems, New Generation Computing 18 (2000) 217\u2013242.","journal-title":"New Generation Computing"},{"key":"25_CR15","first-page":"67","volume":"4","author":"B. K. Natarajan","year":"1989","unstructured":"B. K. Natarajan, On learning sets and functions, Machine Learning 4 (1989) 67\u201397.","journal-title":"Machine Learning"},{"key":"25_CR16","unstructured":"B. K. Natarajan, Machine Learning-A Theoretical Approach, Morgan Kaufmann Publ., 1991."},{"key":"25_CR17","unstructured":"H. Rogers Jr., Theory of Recursive Functions and Effective Computability, MIT Press, 1987."},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF03037094","volume":"8","author":"T. Shinohara","year":"1991","unstructured":"T. Shinohara, Inductive inference of monotonic formal systems from positive data, New Generation Computing 8 (1991) 371\u2013384.","journal-title":"New Generation Computing"},{"key":"25_CR19","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":"25_CR20","doi-asserted-by":"crossref","unstructured":"R. M. Smullyan, Theory of Formal Systems, Annals of Mathematical Studies, No. 47, Princeton University, 1961.","DOI":"10.1515\/9781400882007"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1023\/A:1007562322031","volume":"34","author":"S. Soderland","year":"1997","unstructured":"S. Soderland, Learning information extraction rules from semi-structured and free text, Machine Learning 34 (1997) 233\u2013272.","journal-title":"Machine Learning"},{"key":"25_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1008792020665","volume":"14","author":"B. Thomas","year":"2000","unstructured":"B. Thomas, Token-Templates and Logic Programs for IntelligentWeb Search, Journal of Intelligent Information Systems 14 (2000) 241\u2013261.","journal-title":"Journal of Intelligent Information Systems"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"L. Valiant, A theory of the learnable, Communications of the ACM 27 (1984) 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"25_CR24","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 systems, Journal of Logic Programming 13 (1992) 89\u201397.","journal-title":"Journal of Logic Programming"},{"key":"25_CR25","unstructured":"C. Zeng, S. Arikawa, Applying inverse resolution to EFS language learning, in: Proc. Int. Conference for Young Computer Scientists, Int. Academic Publishers, 1999, pp. 480\u2013487."},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"T. Zeugmann, S. Lange, A guided tour across the boundaries of learning recursive languages, in: Algorithmic Learning for Knowledge-Based Systems, K. P. Jantke and S. Lange (eds), LNAI 961, Springer-Verlag, 1995, pp. 190\u2013258.","DOI":"10.1007\/3-540-60217-8_12"}],"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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,25]],"date-time":"2021-08-25T23:02:12Z","timestamp":1629932532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_25","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"}}]}}