{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:54Z","timestamp":1725663594972},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569398"},{"type":"electronic","value":"9783540478263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_80","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:58Z","timestamp":1330257358000},"page":"289-300","source":"Crossref","is-referenced-by-count":0,"title":["Learnability: Admissible, co-finite, and hypersimple languages"],"prefix":"10.1007","author":[{"given":"Ganesh","family":"Baliga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Case","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"24_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":"24_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":"24_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":"24_CR4","unstructured":"J. Case. Learning machines. In W. Demopoulos and A. Marras, editors, Language Learning and Concept Acquisition. Ablex Publishing Company, 1986."},{"key":"24_CR5","unstructured":"J. Case. The power of vacillation. In D. Haussler and L. Pitt, editors, Proceedings of the Workshop on Computational Learning Theory, pages 133\u2013142. Morgan Kaufmann Publishers, Inc., 1988. Expanded in [Cas92]."},{"key":"24_CR6","unstructured":"J. Case. The power of vacillation in language learning. Technical Report 93-08, University of Delaware, 1992. Expands on [Cas88]; journal article under review."},{"key":"24_CR7","first-page":"107","volume-title":"Machine inductive inference and language identification","author":"J. Case","year":"1982","unstructured":"J. Case and C. Lynes. Machine inductive inference and language identification. In M. Nielsen and E. M. Schmidt, editors, Proceedings of the 9th International Colloquium on Automata, Languages and Programming, volume 140, pages 107\u2013115. Springer-Verlag, Berlin, 1982."},{"key":"24_CR8","volume-title":"PhD thesis","author":"M. Fulk","year":"1985","unstructured":"M. Fulk. A Study of Inductive Inference machines. PhD thesis, SUNY at Buffalo, 1985."},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","volume":"85","author":"M. Fulk","year":"1990","unstructured":"M. Fulk. Prudence and other conditions on formal language learning. Information and Computation, 85:1\u201311, 1990.","journal-title":"Information and Computation"},{"key":"24_CR10","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":"24_CR11","unstructured":"J. Hopcroft and J. Ullman. Introduction to Automata Theory Languages and Computation. Addison-Wesley Publishing Company, 1979."},{"issue":"2","key":"24_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0022-0000(81)90013-1","volume":"23","author":"Deborah Joseph","year":"1981","unstructured":"D. Joseph and P. Young. Independence results in computer science? Journal of Computer and System Sciences, pages 205\u2013222, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR13","first-page":"109","volume":"22","author":"G. Kreisel","year":"1957","unstructured":"G. Kreisel. Independent recursive axiomizability. Journal of Symbolic Logic, 22:109, 1957.","journal-title":"Journal of Symbolic Logic"},{"key":"24_CR14","unstructured":"D. McNeill. Developmental psycholinguistics. In F. Smith and G. A. Miller, editors, The Genesis of Language, pages 15\u201384. MIT Press, 1966."},{"key":"24_CR15","volume-title":"An Introduction to the General Theory of Algorithms","author":"M. Machtey","year":"1978","unstructured":"M. Machtey and P. Young. An Introduction to the General Theory of Algorithms. North Holland, New York, 1978."},{"key":"24_CR16","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1207\/s15516709cog0603_3","volume":"6","author":"D. Osherson","year":"1982","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Ideal learning machines. Cognitive Science, 6:277\u2013290, 1982.","journal-title":"Cognitive Science"},{"key":"24_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0010-0277(84)90040-4","volume":"17","author":"D. Osherson","year":"1984","unstructured":"D. Osherson, M. Stob, and S. Weinstein. Learning theory and natural language. Cognition, 17:1\u201328, 1984.","journal-title":"Cognition"},{"key":"24_CR18","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":"24_CR19","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":"24_CR20","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":"24_CR21","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1002\/malq.19680142505","volume":"14","author":"M. Pour-El","year":"1968","unstructured":"M. Pour-El. Independent axiomatization and its relation to the hypersimple set. Zeitschr. j. math. Logik und Grundlagen d. Math. Bd., 14:449\u2013456, 1968.","journal-title":"Zeitschr. j. math. Logik und Grundlagen d. Math. Bd."},{"key":"24_CR22","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":"24_CR23","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","volume":"50","author":"E. Post","year":"1944","unstructured":"E. Post. Recursively enumerable sets of positive integers and their decision problems. Bulletin of the American Mathematical Society, 50:284\u2013316, 1944.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"24_CR24","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":"24_CR25","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967. Reprinted, MIT Press 1987."},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"J. Royer. A Connotational Theory of Program Structure. Lecture Notes in Computer Science 273. Springer Verlag, 1987.","DOI":"10.1007\/3-540-18253-5"},{"key":"24_CR27","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":"24_CR28","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:57:40Z","timestamp":1619571460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}