{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:42:00Z","timestamp":1747546920845},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6925,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/s0022-0000(05)80088-1","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"96-107","source":"Crossref","is-referenced-by-count":9,"title":["Characterizing language identification by standardizing operations"],"prefix":"10.1016","volume":"49","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arun","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80088-1_bib1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80088-1_bib2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80088-1_bib3","series-title":"Proceedings, Second Annual Workshop on Computational Learning Theory, Santa Cruz, CA","first-page":"189","article-title":"Convergence to nearly minimal size grammars by vacillating learning machines","author":"Case","year":"1989"},{"key":"10.1016\/S0022-0000(05)80088-1_bib4","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0019-9958(82)80086-7","article-title":"Trade-offs in inductive inference of nearly minimal sized programs","volume":"52","author":"Chen","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80088-1_bib5","first-page":"219","volume":"Vol. 32","author":"Freivalds","year":"1975"},{"key":"10.1016\/S0022-0000(05)80088-1_bib6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/malq.19840300904","article-title":"Connections between identifying functions, standardizing operations, and computable numbering","volume":"30","author":"Freivalds","year":"1984","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0022-0000(05)80088-1_bib7","series-title":"Proceedings, Second International Workshop on Anological and Inductive Inference","first-page":"1","article-title":"Inductive inference from good examples","author":"Freivalds","year":"1989"},{"key":"10.1016\/S0022-0000(05)80088-1_bib8","article-title":"A Study of Inductive Inference Machines","author":"Fulk","year":"1985","journal-title":"Ph.D. thesis, SUNY at Buffalo"},{"key":"10.1016\/S0022-0000(05)80088-1_bib9","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0890-5401(88)90019-3","article-title":"Saving the phenomenon: Requirements that inductive machines not contradict known data","volume":"79","author":"Fulk","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80088-1_bib10","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80088-1_bib11","series-title":"Introduction to Automata Theory Languages and Computation","author":"Hopcroft","year":"1979"},{"issue":"No. 2","key":"10.1016\/S0022-0000(05)80088-1_bib12","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0890-5401(91)90043-2","article-title":"Learning in the presence of partial explanations","volume":"95","author":"Jain","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80088-1_bib13","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1006\/inco.1993.1005","article-title":"Learning with the knowledge of an upper bound on program size","volume":"102","author":"Jain","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0022-0000(05)80088-1_bib14","first-page":"45","article-title":"On comparison of limit identification and limit standardization of general recursive functions","volume":"233","author":"Kinber","year":"1975","journal-title":"Uchen Zap. Latv. Univ."},{"key":"10.1016\/S0022-0000(05)80088-1_bib15","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-2496(83)90027-5","article-title":"Note on a central lemma of learning theory","volume":"27","author":"Osherson","year":"1983","journal-title":"J. Math. Psychol."},{"key":"10.1016\/S0022-0000(05)80088-1_bib16","series-title":"Systems That Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"Osherson","year":"1986"},{"key":"10.1016\/S0022-0000(05)80088-1_bib17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0010-0277(82)90005-1","article-title":"A note on formal learning theory","volume":"11","author":"Osherson","year":"1982","journal-title":"Cognition"},{"key":"10.1016\/S0022-0000(05)80088-1_bib18","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0010-0277(79)90001-5","article-title":"Formal models of language learning","volume":"7","author":"Pinker","year":"1979","journal-title":"Cognition"},{"key":"10.1016\/S0022-0000(05)80088-1_bib19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","article-title":"G\u00f6del numberings of partial recursive functions","volume":"23","author":"Rogers","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0022-0000(05)80088-1_bib20","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(05)80088-1_bib21","article-title":"Uber Eingabeabh\u00e4ngigkeit und Komplexit\u00e4t von Inferenzstrategien","author":"Sch\u00e4fer-Richer","year":"1984"},{"key":"10.1016\/S0022-0000(05)80088-1_bib22","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0010-0277(82)90006-3","article-title":"On extensional learnability","volume":"11","author":"Wexler","year":"1982","journal-title":"Cognition"},{"key":"10.1016\/S0022-0000(05)80088-1_bib23","series-title":"Formal Principles of Language Acquisition","author":"Wexler","year":"1980"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800881?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800881?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,22]],"date-time":"2019-01-22T22:27:25Z","timestamp":1548196045000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800881"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["S0022000005800881"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80088-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}