{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:23Z","timestamp":1725486083258},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729259"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72927-3_16","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"203-217","source":"Crossref","is-referenced-by-count":1,"title":["Learning Correction Grammars"],"prefix":"10.1007","author":[{"given":"Lorenzo","family":"Carlucci","sequence":"first","affiliation":[]},{"given":"John","family":"Case","sequence":"additional","affiliation":[]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.2178\/jsl\/1080938842","volume":"69","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A., Case, J., Jain, S., Suraj, M.: Parsimony Hierarchies for Inductive Inference. Journal of Symbolic Logic\u00a069(1), 287\u2013327 (2004)","journal-title":"Journal of Symbolic Logic"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1002\/malq.19960420138","volume":"42","author":"J. Ash","year":"1996","unstructured":"Ash, J., Knight, J.F.: Recursive Structures and Ershov\u2019s Hierarchy. Mathematical Logic Quarterly\u00a042, 461\u2013468 (1996)","journal-title":"Mathematical Logic Quarterly"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Information and Control\u00a028, 125\u2013155 (1975)","journal-title":"Information and Control"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"Blum, M.: A machine-independent theory of the complexity of recursive functions. Journal of the ACM\u00a014, 322\u2013336 (1967)","journal-title":"Journal of the ACM"},{"key":"16_CR5","unstructured":"Burgin, M.: Grammars with prohibition and human-computer interaction. In: Proceedings of the 2005 Business and Industry Symposium and the 2005 Military, Government, and Aerospace Simulation Symposium, pp. 143\u2013147. Society for Modeling and Simulation (2005)"},{"key":"16_CR6","unstructured":"Carlucci, L., Case, J., Jain, S.: Learning correction grammars. TR12\/06, National University of Singapore (December 2006)"},{"issue":"6","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/S0097539793249694","volume":"28","author":"J. Case","year":"1999","unstructured":"Case, J.: The power of vacillation in language learning. SIAM Journal on Computing\u00a028(6), 1941\u20131969 (1999)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1142\/S0129054192000097","volume":"3","author":"J. Case","year":"1992","unstructured":"Case, J., Jain, S., Sharma, A.: On learning limiting programs. International Journal of Foundations of Computer Science\u00a03(1), 93\u2013115 (1992)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Automata, Languages, and Programming","author":"J. Case","year":"1982","unstructured":"Case, J., Lynes, C.: Machine inductive inference and language identification. In: Nielsen, M., Schmidt, E.M. (eds.) Automata, Languages, and Programming. LNCS, vol.\u00a0140, pp. 107\u2013115. Springer, Heidelberg (1982)"},{"key":"16_CR10","unstructured":"Case, J., Royer, J.: Program size complexity of correction grammars. Preprint (2006)"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science\u00a025, 193\u2013220 (1983)","journal-title":"Theoretical Computer Science"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0019-9958(82)80086-7","volume":"52","author":"K. Chen","year":"1982","unstructured":"Chen, K.: Tradeoffs in inductive inference of nearly minimal sized programs. Information and Control\u00a052, 68\u201386 (1982)","journal-title":"Information and Control"},{"key":"16_CR13","first-page":"23","volume":"7","author":"Y.L. Ershov","year":"1968","unstructured":"Ershov, Y.L.: A hierarchy of sets I. Algebra and Logic\u00a07, 23\u201343 (1968)","journal-title":"Algebra and Logic"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/BF02218664","volume":"7","author":"Y.L. Ershov","year":"1968","unstructured":"Ershov, Y.L.: A hierarchy of sets II. Algebra and Logic\u00a07, 212\u2013232 (1968)","journal-title":"Algebra and Logic"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BF02219847","volume":"9","author":"Y.L. Ershov","year":"1970","unstructured":"Ershov, Y.L.: A hierarchy of sets III. Algebra and Logic\u00a09, 20\u201331 (1970)","journal-title":"Algebra and Logic"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/3-540-07389-2_199","volume-title":"Minimal G\u00f6del numbers and their identification in the limit","author":"R. Freivalds","year":"1975","unstructured":"Freivalds, R.: Minimal G\u00f6del numbers and their identification in the limit. LNCS, vol.\u00a032, pp. 219\u2013225. Springer, Heidelberg (1975)"},{"key":"16_CR17","first-page":"3","volume-title":"Proceedings of the Third Annual Workshop on Computational Learning Theory","author":"R. Freivalds","year":"1990","unstructured":"Freivalds, R.: Inductive inference of minimal programs. In: Fulk, M., Case, J. (eds.) Proceedings of the Third Annual Workshop on Computational Learning Theory, pp. 3\u201320. Morgan Kaufmann Publishers, Inc. San Francisco (1990)"},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1006\/inco.1993.1068","volume":"107","author":"R. Freivalds","year":"1993","unstructured":"Freivalds, R., Smith, C.: On the role of procrastination in machine learning. Information and Computation\u00a0107(2), 237\u2013271 (1993)","journal-title":"Information and Computation"},{"key":"16_CR19","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\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"16_CR20","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, London (1979)"},{"key":"16_CR21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that Learn: An Introduction to Learning Theory","author":"S. Jain","year":"1999","unstructured":"Jain, S., Osherson, D., Royer, J., Sharma, A.: Systems that Learn: An Introduction to Learning Theory, 2nd edn. MIT Press, Cambridge (1999)","edition":"2"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0304-3975(94)90047-7","volume":"127","author":"S. Jain","year":"1994","unstructured":"Jain, S., Sharma, A.: Program Size Restrictions in Computational Learning. Theoretical Computer Science\u00a0127, 351\u2013386 (1994)","journal-title":"Theoretical Computer Science"},{"key":"16_CR23","first-page":"221","volume":"1","author":"E. Kinber","year":"1974","unstructured":"Kinber, E.: On the synthesis in the limit of almost minimal G\u00f6del numbers. Theory Of Algorithms and Programs, LSU, Riga.\u00a01, 221\u2013223 (1974)","journal-title":"Theory Of Algorithms and Programs, LSU, Riga"},{"key":"16_CR24","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"S.C. Kleene","year":"1938","unstructured":"Kleene, S.C.: On notation for ordinal numbers. Journal of Symbolic Logic\u00a03, 150\u2013155 (1938)","journal-title":"Journal of Symbolic Logic"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.2307\/2371894","volume":"66","author":"S.C. Kleene","year":"1944","unstructured":"Kleene, S.C.: On the forms of predicates in the theory of constructive ordinals. American Journal of Mathematics\u00a066, 41\u201358 (1944)","journal-title":"American Journal of Mathematics"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"405","DOI":"10.2307\/2372632","volume":"77","author":"S.C. Kleene","year":"1955","unstructured":"Kleene, S.C.: On the forms of predicates in the theory of constructive ordinals (second paper). American Journal of Mathematics\u00a077, 405\u2013428 (1955)","journal-title":"American Journal of Mathematics"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","volume":"52","author":"D. Osherson","year":"1982","unstructured":"Osherson, D., Weinstein, S.: Criteria for language learning. Information and Control\u00a052, 123\u2013138 (1982)","journal-title":"Information and Control"},{"key":"16_CR28","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967. Reprinted by MIT Press in (1987)"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Royer, J., Case, J.: Subrecursive Programming Systems: Complexity & Succinctness. Birkh\u00e4user (1994)","DOI":"10.1007\/978-1-4612-0249-3"},{"key":"16_CR30","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s001530050112","volume":"18","author":"M. Schaefer","year":"1998","unstructured":"Schaefer, M.: A guided tour of minimal indices and shortest descriptions. Archive for Mathematical Logic\u00a018, 521\u2013548 (1998)","journal-title":"Archive for Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T00:11:58Z","timestamp":1628986318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729259"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_16","relation":{},"subject":[]}}