{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:44:29Z","timestamp":1760647469868,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030800482"},{"type":"electronic","value":"9783030800499"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80049-9_3","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T18:06:14Z","timestamp":1625162774000},"page":"25-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Learning Languages with Decidable Hypotheses"],"prefix":"10.1007","author":[{"given":"Julian","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilian","family":"B\u00f6ther","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vanja","family":"Dosko\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan Gadea","family":"Harder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Klodt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"K\u00f6tzing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Winfried","family":"L\u00f6tzsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jannik","family":"Peters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leon","family":"Schiller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Seifert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin","family":"Wells","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Wietheger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Berger, J., et al.: Learning languages with decidable hypotheses. CoRR (2020)","DOI":"10.1007\/978-3-030-80049-9_3"},{"key":"3_CR2","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. Inf. Control 28, 125\u2013155 (1975)","journal-title":"Inf. Control"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M Blum","year":"1967","unstructured":"Blum, M.: A machine-independent theory of the complexity of recursive functions. J. ACM 14, 322\u2013336 (1967)","journal-title":"J. ACM"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"1551","DOI":"10.1016\/j.ic.2007.04.001","volume":"205","author":"L Carlucci","year":"2007","unstructured":"Carlucci, L., Case, J., Jain, S., Stephan, F.: Results on memory-limited U-shaped learning. Inf. Comput. 205, 1551\u20131573 (2007)","journal-title":"Inf. Comput."},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2016.06.015","volume":"251","author":"J Case","year":"2016","unstructured":"Case, J., K\u00f6tzing, T.: Strongly non-U-shaped language learning results by general techniques. Inf. Comput. 251, 1\u201315 (2016)","journal-title":"Inf. Comput."},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BFb0012761","volume-title":"Automata, Languages and Programming","author":"J Case","year":"1982","unstructured":"Case, J., Lynes, C.: Machine inductive inference and language identification. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 107\u2013115. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0012761"},{"key":"3_CR7","unstructured":"Dosko\u010d, V., K\u00f6tzing, T.: Cautious limit learning. In: Proceedings of the International Conference on Algorithmic Learning Theory (ALT) (2020)"},{"key":"3_CR8","unstructured":"Fulk, M.: A Study of Inductive Inference Machines. Ph.D. thesis (1985)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(90)90042-G","volume":"85","author":"MA Fulk","year":"1990","unstructured":"Fulk, M.A.: Prudence and other conditions on formal language learning. Inf. Comput. 85, 1\u201311 (1990)","journal-title":"Inf. Comput."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10, 447\u2013474 (1967)","journal-title":"Inf. Control"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems that Learn: An Introduction to Learning Theory. MIT Press, Cambridge, Second Edition (1999)","DOI":"10.7551\/mitpress\/6610.001.0001"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/inco.1995.1170","volume":"123","author":"EB Kinber","year":"1995","unstructured":"Kinber, E.B., Stephan, F.: Language learning from texts: Mindchanges, limited memory, and monotonicity. Inf. Comput. 123, 224\u2013241 (1995)","journal-title":"Inf. Comput."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2016.07.028","volume":"650","author":"T K\u00f6tzing","year":"2016","unstructured":"K\u00f6tzing, T., Palenta, R.: A map of update constraints in inductive inference. Theoret. Comput. Sci. 650, 4\u201324 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR14","unstructured":"K\u00f6tzing, T., Schirneck, M., Seidel, K.: Normal forms in semantic language identification. In: Proceedings of the International Conference on Algorithmic Learning Theory (ALT), pp. 76:493\u201376:516 (2017)"},{"key":"3_CR15","unstructured":"K\u00f6tzing, T.: Abstraction and Complexity in Computational Learning in the Limit. Ph.D. thesis, University of Delaware (2009)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.tcs.2008.02.030","volume":"397","author":"S Lange","year":"2008","unstructured":"Lange, S., Zeugmann, T., Zilles, S.: Learning indexed families of recursive languages from positive data: A survey. Theor. Comput. Sci. 397, 194\u2013232 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(82)80025-9","volume":"52","author":"DN Osherson","year":"1982","unstructured":"Osherson, D.N., Weinstein, S.: Criteria of language learning. Inf. Control 52, 123\u2013138 (1982)","journal-title":"Inf. Control"},{"key":"3_CR18","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers Jr","year":"1987","unstructured":"Rogers, H., Jr.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)"},{"key":"3_CR19","unstructured":"Sch\u00e4fer-Richter, G.: \u00dcber Eingabeabh\u00e4ngigkeit und Komplexit\u00e4t von Inferenzstrategien. Ph.D. thesis, RWTH Aachen University, Germany (1984)"},{"key":"3_CR20","volume-title":"Formal Principles of Language Acquisition","author":"K Wexler","year":"1980","unstructured":"Wexler, K., Culicover, P.W.: Formal Principles of Language Acquisition. MIT Press, Cambridge (1980)"},{"key":"3_CR21","first-page":"93","volume":"12","author":"R Wiehagen","year":"1976","unstructured":"Wiehagen, R.: Limes-Erkennung rekursiver Funktionen durch spezielle Strategien. J. Inf. Proc. Cybern. 12, 93\u201399 (1976)","journal-title":"J. Inf. Proc. Cybern."}],"container-title":["Lecture Notes in Computer Science","Connecting with Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80049-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T17:03:41Z","timestamp":1638810221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80049-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030800482","9783030800499"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80049-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cie2021.ugent.be\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}