{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T06:27:40Z","timestamp":1672381660374},"reference-count":33,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"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,10]]},"DOI":"10.1016\/s0022-0000(05)80046-7","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"189-207","source":"Crossref","is-referenced-by-count":8,"title":["Vacillatory learning of nearly minimal size grammars"],"prefix":"10.1016","volume":"49","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","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)80046-7_bib1","series-title":"Mathematical Foundations of Computer Science","article-title":"The theory of inductive inference","author":"Barzdin","year":"1973"},{"key":"10.1016\/S0022-0000(05)80046-7_bib2","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)80046-7_bib3","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)80046-7_bib4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01761704","article-title":"Periodicity in generations of automata","volume":"8","author":"Case","year":"1974","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0022-0000(05)80046-7_bib5","series-title":"Proceedings of the Workshop on Computational Learning Theory","first-page":"133","article-title":"The power of vacillation","author":"Case","year":"1988"},{"key":"10.1016\/S0022-0000(05)80046-7_bib6","unstructured":"J. Case, The power of vacillation in language learning, in preparation."},{"key":"10.1016\/S0022-0000(05)80046-7_bib7","article-title":"The Power of Vacillation in Language Learning","author":"Case","year":"1992"},{"key":"10.1016\/S0022-0000(05)80046-7_bib8","unstructured":"J. Case and H. Chi, Machine learning of nearly minial size grammars, unpublished."},{"key":"10.1016\/S0022-0000(05)80046-7_bib9","series-title":"Proceedings of the 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)80046-7_bib10","series-title":"Proceedings, Foundations of Software Technology and Theoretical Computer Science, Eleventh Conference, New Delhi, India","first-page":"121","article-title":"Complexity issues for vacillatory function identification","volume":"Vol. 560","author":"Case","year":"1991"},{"key":"10.1016\/S0022-0000(05)80046-7_bib11","first-page":"107","article-title":"Machine inductive inference and language identification","volume":"Vol. 140","author":"Case","year":"1982"},{"key":"10.1016\/S0022-0000(05)80046-7_bib12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sc."},{"key":"10.1016\/S0022-0000(05)80046-7_bib13","article-title":"Tradeoffs in Machine Inductive Inference","author":"Chen","year":"1981"},{"key":"10.1016\/S0022-0000(05)80046-7_bib14","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)80046-7_bib15","first-page":"219","article-title":"Minimal G\u00f6del numbers and their identification in the limit","volume":"Vol. 32","author":"Freivalds","year":"1975"},{"key":"10.1016\/S0022-0000(05)80046-7_bib16","article-title":"A study of inductive Inference Machines","author":"Fulk","year":"1985"},{"key":"10.1016\/S0022-0000(05)80046-7_bib17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","article-title":"Prudence and other conditions on formal language learning","volume":"85","author":"Fulk","year":"1990","journal-title":"Inform. and Computat."},{"key":"10.1016\/S0022-0000(05)80046-7_bib18","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)80046-7_bib19","series-title":"Introduction to Automata Theory Languages and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0022-0000(05)80046-7_bib20","series-title":"Proceedings, MLNLO'91, Machine Learning of Natural Language and Ontology, Stanford University, CA","first-page":"87","article-title":"Restrictions on grammar size in language identification","author":"Jain","year":"1991"},{"key":"10.1016\/S0022-0000(05)80046-7_bib21","doi-asserted-by":"crossref","unstructured":"S. Jain and A. Sharma, Program size restrictions in computational learning, Thereti. Comput. Sci. A, to appear.","DOI":"10.1016\/0304-3975(94)90047-7"},{"key":"10.1016\/S0022-0000(05)80046-7_bib22","first-page":"435","article-title":"On a theory of inductive inference","volume":"Vol. 55","author":"Kinber","year":"1977"},{"key":"10.1016\/S0022-0000(05)80046-7_bib23","series-title":"An Introduction to the General Theory of Algorithms","author":"Machtey","year":"1978"},{"key":"10.1016\/S0022-0000(05)80046-7_bib24","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)80046-7_bib25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0010-0277(84)90040-4","article-title":"Learning theory and natural language","volume":"17","author":"Osherson","year":"1984","journal-title":"Cognition"},{"key":"10.1016\/S0022-0000(05)80046-7_bib26","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)80046-7_bib27","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","article-title":"Criteria of language learning","volume":"52","author":"Osherson","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/S0022-0000(05)80046-7_bib28","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)80046-7_bib29","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)80046-7_bib30","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/S0022-0000(05)80046-7_bib31","unstructured":"J. Royer and J. Case, \u201cIntensional Subrecursion and Complexity Theory,\u201d Research Notes in Theoretical Science, Pitman, New York\/London, in preparation."},{"key":"10.1016\/S0022-0000(05)80046-7_bib32","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0010-0277(82)90006-3","article-title":"On extansional learnability","volume":"11","author":"Wexler","year":"1982","journal-title":"Cognition"},{"key":"10.1016\/S0022-0000(05)80046-7_bib33","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:S0022000005800467?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800467?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:20Z","timestamp":1548196040000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800467"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["S0022000005800467"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80046-7","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}