{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:39Z","timestamp":1725456999579},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032029","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"153-166","source":"Crossref","is-referenced-by-count":6,"title":["Language learning by a \u201cteam\u201d"],"prefix":"10.1007","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":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125\u2013155, 1975.","journal-title":"Information and Control"},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum. A machine independent theory of the complexity of recursive functions. Journal of the ACM, 14:322\u2013336, 1967.","journal-title":"Journal of the ACM"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01761704","volume":"8","author":"J. Case","year":"1974","unstructured":"J. Case. Periodicity in generations of automata. Mathematical Systems Theory, 8:15\u201332, 1974.","journal-title":"Mathematical Systems Theory"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BFb0012761","volume":"140","author":"J. Case","year":"1982","unstructured":"J. Case and C. Lynes. Machine inductive inference and language identification. Lecture Notes in Computer Science, Springer-Verlag, Berlin, 140:107\u2013115, 1982.","journal-title":"Lecture Notes in Computer Science, Springer-Verlag, Berlin"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J. Case","year":"1983","unstructured":"J. Case and C. Smith. Comparision of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193\u2013220, 1983.","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"E.M. Gold. Language identification in the limit. Information and Control, 10:447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"13_CR7","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"M. Machtey and J. Young. An Introduction to the General Theory of Algorithms. North Holland, New York, 1978."},{"key":"13_CR8","volume-title":"Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D. Osherson","year":"1986","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Systems that Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge, Mass., 1986."},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","volume":"52","author":"D. Osherson","year":"1982","unstructured":"D. Osherson and S. Weinstein. Criteria of language learning. Information and Control, 52:123\u2013138, 1982.","journal-title":"Information and Control"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0010-0277(82)90005-1","volume":"11","author":"D. Osherson","year":"1982","unstructured":"D. Osherson and S. Weinstein. A note on formal learning theory. Cognition, 11:77\u201388, 1982.","journal-title":"Cognition"},{"key":"13_CR11","unstructured":"M. Pleszkoch, G. Gasarch, S. Jain, and R. Solovay. Learning via queries to an oracle. 1990. Submitted for publication."},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0010-0277(79)90001-5","volume":"7","author":"S. Pinker","year":"1979","unstructured":"S. Pinker. Formal models of language learning. Cognition, 7:217\u2013283, 1979.","journal-title":"Cognition"},{"key":"13_CR13","unstructured":"L. Pitt. A characterization of probabilistic inference. PhD thesis, Yale Univ., 1984."},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/62044.62053","volume":"36","author":"L. Pitt","year":"1989","unstructured":"L. Pitt. Probabilistic inductive inference. Journal of the ACM, 36:383\u2013433, 1989.","journal-title":"Journal of the ACM"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0890-5401(88)90046-6","volume":"77","author":"L. Pitt","year":"1988","unstructured":"L. Pitt and C. Smith. Probability and plurality for aggregations of learning machines. Information and Computation, 77:77\u201392, 1988.","journal-title":"Information and Computation"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers","year":"1958","unstructured":"H. Rogers. G\u00f6del numberings of partial recursive functions. Journal of Symbolic Logic, 23:331\u2013341, 1958.","journal-title":"Journal of Symbolic Logic"},{"key":"13_CR17","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1987","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge, Massachusetts, 1987."},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"1144","DOI":"10.1145\/322344.322356","volume":"29","author":"C. Smith","year":"1982","unstructured":"C. Smith. The power of pluralism for automatic program synthesis. Journal of the ACM, 29:1144\u20131165, 1982.","journal-title":"Journal of the ACM"},{"key":"13_CR19","volume-title":"Formal Principles of Language Acquisition","author":"K. Wexler","year":"1980","unstructured":"K. Wexler and P. Culicover. Formal Principles of Language Acquisition. MIT Press, Cambridge, Mass, 1980."},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0010-0277(82)90006-3","volume":"11","author":"K. Wexler","year":"1982","unstructured":"K. Wexler. On extensional learnability. Cognition, 11:89\u201395, 1982.","journal-title":"Cognition"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032029.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:05:32Z","timestamp":1607551532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0032029","relation":{},"subject":[]}}