{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:03:35Z","timestamp":1769972615390,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642044137","type":"print"},{"value":"9783642044144","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04414-4_23","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T08:46:05Z","timestamp":1253609165000},"page":"263-277","source":"Crossref","is-referenced-by-count":6,"title":["Difficulties in Forcing Fairness of Polynomial Time Inductive Inference"],"prefix":"10.1007","author":[{"given":"John","family":"Case","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045, 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"23_CR2","unstructured":"B\u0101rzdi\u0146\u0161, J.: Inductive inference of automata, functions and programs. In: Int. Math. Congress, Vancouver, pp. 771\u2013776 (1974)"},{"key":"23_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":"23_CR4","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)"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.2178\/jsl\/1243948324","volume":"74","author":"L. Carlucci","year":"2009","unstructured":"Carlucci, L., Case, J., Jain, S.: Learning correction grammars. Journal of Symbolic Logic\u00a074(2), 489\u2013516 (2009)","journal-title":"Journal of Symbolic Logic"},{"key":"23_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-540-87987-9_33","volume-title":"Algorithmic Learning Theory","author":"J. Case","year":"2008","unstructured":"Case, J., K\u00f6tzing, T.: Dynamic modeling in inductive inference. In: Freund, Y., Gy\u00f6rfi, L., Tur\u00e1n, G., Zeugmann, T. (eds.) ALT 2008. LNCS (LNAI), vol.\u00a05254, pp. 404\u2013418. Springer, Heidelberg (2008)"},{"key":"23_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-87987-9_32","volume-title":"Algorithmic Learning Theory","author":"J. Case","year":"2008","unstructured":"Case, J., K\u00f6tzing, T.: Dynamically delayed postdictive completeness and consistency in learning. In: Freund, Y., Gy\u00f6rfi, L., Tur\u00e1n, G., Zeugmann, T. (eds.) ALT 2008. LNCS (LNAI), vol.\u00a05254, pp. 389\u2013403. Springer, Heidelberg (2008)"},{"key":"23_CR8","unstructured":"Case, J., Royer, J.: Program size complexity of correction grammars, Working draft (2009)"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0890-5401(88)90019-3","volume":"79","author":"M. Fulk","year":"1988","unstructured":"Fulk, M.: Saving the phenomenon: Requirements that inductive machines not contradict known data. Information and Computation\u00a079, 193\u2013209 (1988)","journal-title":"Information and Computation"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Gold","year":"1967","unstructured":"Gold, E.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"23_CR11","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 Publishing Company, Reading (1979)"},{"key":"23_CR12","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":"23_CR13","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"Knuth, D.: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Reading (1973)"},{"key":"23_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"key":"23_CR15","volume-title":"Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists","author":"D. Osherson","year":"1986","unstructured":"Osherson, D., Stob, M., Weinstein, S.: Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge (1986)"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/3-540-51734-0_50","volume-title":"Analogical and Inductive Inference","author":"L. Pitt","year":"1989","unstructured":"Pitt, L.: Inductive inference, DFAs, and computational complexity. In: Jantke, K.P. (ed.) AII 1989. LNCS, vol.\u00a0397, pp. 18\u201344. Springer, Heidelberg (1989)"},{"key":"23_CR17","series-title":"Research monograph in Progress in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0249-3","volume-title":"Subrecursive Programming Systems: Complexity and Succinctness","author":"J. Royer","year":"1994","unstructured":"Royer, J., Case, J.: Subrecursive Programming Systems: Complexity and Succinctness. Research monograph in Progress in Theoretical Computer Science. Birkh\u00e4user, Boston (1994)"},{"key":"23_CR18","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York (1967); Reprinted by MIT Press, Cambridge, Massachusetts (1987)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Schabes, Y.: Polynomial time and space shift-reduce parsing of arbitrary context-free grammars. In: Proceedings of the 29th annual meeting on Association for Computational Linguistics, pp. 106\u2013113. Association for Computational Linguistics (1991)","DOI":"10.3115\/981344.981358"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: Machine models and simulations. In: Van Leeuwen, J. (ed.) Handbbook of Theoretical Computer Science. Algorithms and Complexity, vol.\u00a0A, pp. 3\u201366. MIT\u00a0Press\/Elsevier (1990)","DOI":"10.1016\/B978-0-444-88071-0.50006-0"},{"key":"23_CR21","unstructured":"Weinstein, S.: Private communication at the Workshop on Learnability Theory and Linguistics, University of Western Ontario (1982)"},{"key":"23_CR22","first-page":"93","volume":"12","author":"R. Wiehagen","year":"1976","unstructured":"Wiehagen, R.: Limes-erkennung rekursiver funktionen durch spezielle strategien. Elektronische Informationverarbeitung und Kybernetik\u00a012, 93\u201399 (1976)","journal-title":"Elektronische Informationverarbeitung und Kybernetik"},{"key":"23_CR23","unstructured":"Wiehagen, R.: Zur Theorie der Algorithmischen Erkennung. PhD thesis, Humboldt University of Berlin (1978)"},{"key":"#cr-split#-23_CR24.1","doi-asserted-by":"crossref","unstructured":"Yoshinaka, R.: Learning efficiency of very simple grammars from positive data. Theoretical Computer Science??410, 1807???1825 (2009);","DOI":"10.1016\/j.tcs.2009.01.012"},{"key":"#cr-split#-23_CR24.2","unstructured":"In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol.??4754, pp. 227???241. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04414-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,22]],"date-time":"2020-05-22T10:50:41Z","timestamp":1590144641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04414-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044137","9783642044144"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04414-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}