{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:47:33Z","timestamp":1743004053538,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030681944"},{"type":"electronic","value":"9783030681951"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/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":"http:\/\/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-68195-1_12","type":"book-chapter","created":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:04:27Z","timestamp":1613952267000},"page":"145-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learnability and Positive Equivalence Relations"],"prefix":"10.1007","author":[{"given":"David","family":"Belanger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziyuan","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,22]]},"reference":[{"key":"12_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. Inf. Control 45, 117\u2013135 (1980)","journal-title":"Inf. Control"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1006\/inco.1998.2782","volume":"152","author":"G Baliga","year":"1999","unstructured":"Baliga, G., Case, J., Jain, S.: The synthesis of language learners. Inf. Comput. 152(1), 16\u201343 (1999)","journal-title":"Inf. Comput."},{"key":"12_CR3","unstructured":"B$$\\bar{\\rm {a}}$$rzdin\u0327s\u0306, J.M.: Two theorems on the limiting synthesis of functions. In: B$$\\bar{\\rm {a}}$$rzdin\u0327s\u0306, J.M. (ed.) Theory of Algorithms and Programs I, Proceedings of the Latvian State University, vol. 210, pp. 82\u201388. Latvian State University, Riga (1974). (in Russian)"},{"key":"12_CR4","unstructured":"B$$\\bar{\\rm a}$$rzdin\u0327s\u0306, J.M.: Inductive inference of automata, functions and programs. In: American Mathematical Society Translations, pp. 107\u2013122, 1977. Appeared Originally in the Proceedings of the 20-th International Congress of Mathematicians 1974, vol. 2, pp. 455\u2013460 (1974). (in Russian)"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1002\/malq.19740200105","volume":"20","author":"W Baur","year":"1974","unstructured":"Baur, W.: Rekursive Algebren mit Kettenbedingungen. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik 20, 37\u201346 (1974). (in German)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"key":"12_CR6","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"},{"issue":"6","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1137\/S0097539793249694","volume":"28","author":"J Case","year":"1999","unstructured":"Case, J.: The power of vacillation in language learning. SIAM J. Comput. 28(6), 1941\u20131969 (1999)","journal-title":"SIAM J. Comput."},{"key":"12_CR8","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":"12_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","volume":"25","author":"J Case","year":"1983","unstructured":"Case, J., Smith, C.: Comparison of identification criteria for machine inductive inference. Theoret. Comput. Sci. 25, 193\u2013220 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"12_CR10","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/BF02218645","volume":"10","author":"YL Ershov","year":"1974","unstructured":"Ershov, Y.L.: Positive equivalences. Algebra Logic 10(6), 378\u2013394 (1974)","journal-title":"Algebra Logic"},{"key":"12_CR11","volume-title":"Theory of Numberings","author":"YL Ershov","year":"1977","unstructured":"Ershov, Y.L.: Theory of Numberings. Nauka, Moscow (1977). (in Russian)"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0019-9958(72)90424-X","volume":"20","author":"JA Feldman","year":"1972","unstructured":"Feldman, J.A.: Some decidability results on grammatical inference and complexity. Inf. Control 20(3), 244\u2013262 (1972)","journal-title":"Inf. Control"},{"issue":"2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1017\/jsl.2015.11","volume":"81","author":"E Fokina","year":"2016","unstructured":"Fokina, E., Khoussainov, B., Semukhin, P., Turetsky, D.: Linear orders realized by c.e. equivalence relations. J. Symbol. Logic 81(2), 463\u2013482 (2016)","journal-title":"J. Symbol. Logic"},{"key":"12_CR14","unstructured":"Fokina, E.B., K\u00f6tzing, T., Mauro, L.S.: Limit learning equivalence structures. In: Proceedings of the 30th International Conference on Algorithmic Learning Theory (ALT 2019), pp. 383\u2013403 (2019)"},{"key":"12_CR15","unstructured":"Fulk, M.: A study of inductive inference machines. Ph.D. thesis, SUNY\/Buffalo (1985)"},{"key":"12_CR16","unstructured":"Gavruskin, A., Jain, S., Khoussainov, B., Stephan, F.: Graphs realised by r.e. equivalence relations. Ann. Pure Appl. Logic 165, 1263\u20131290 (2014)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2015.11.042","volume":"612","author":"A Gavryushkin","year":"2016","unstructured":"Gavryushkin, A., Khoussainov, B., Stephan, F.: Reducibilities among equivalence relations induced by recursively enumerable structures. Theoret. Comput. Sci. 612, 137\u2013152 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Mark Gold, E.: Language identification in the limit. Inf. Control 10, 447\u2013474 (1967)","DOI":"10.1016\/S0019-9958(67)91165-5"},{"key":"12_CR19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems That Learn","author":"S Jain","year":"1999","unstructured":"Jain, S., Osherson, D.N., Royer, J.S., Sharma, A.: Systems That Learn, 2nd edn. MIT Press, Cambridge (1999)","edition":"2"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(90)90141-4","volume":"74","author":"M Kummer","year":"1990","unstructured":"Kummer, M.: An easy priority-free proof of a theorem of Friedberg. Theoret. Comput. Sci. 74, 249\u2013251 (1990)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Lange, S., Zeugmann, T.: Types of monotonic language learning and their characterization. In: Haussler, D. (ed.) Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, Pittsburgh, Pennsylvania, 27\u201329 July 1992, pp. 377\u2013390. ACM Press, New York (1992)","DOI":"10.1145\/130385.130427"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0030397","volume-title":"Nonmonotonic and Inductive Logic","author":"S Lange","year":"1993","unstructured":"Lange, S., Zeugmann, T.: Monotonic versus non-monotonic language learning. In: Brewka, G., Jantke, K.P., Schmitt, P.H. (eds.) NIL 1991. LNCS, vol. 659, pp. 254\u2013269. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/BFb0030397"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-56004-1_18","volume-title":"Analogical and Inductive Inference","author":"Y Mukouchi","year":"1992","unstructured":"Mukouchi, Y.: Characterization of finite identification. In: Jantke, K.P. (ed.) AII 1992. LNCS, vol. 642, pp. 260\u2013267. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-56004-1_18"},{"key":"12_CR24","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/BF01464225","volume":"83","author":"E Noether","year":"1921","unstructured":"Noether, E.: Idealtheorie in Ringbereichen. Mathematische Annalen 83, 24\u201366 (1921)","journal-title":"Mathematische Annalen"},{"key":"12_CR25","unstructured":"Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Acad. Sci. USSR 44, 3\u2013143 (1955)"},{"key":"12_CR26","volume-title":"Classical Recursion Theory","author":"P Odifreddi","year":"1989","unstructured":"Odifreddi, P.: Classical Recursion Theory. North-Holland, Amsterdam (1989)"},{"key":"12_CR27","volume-title":"Classical Recursion Theory","author":"P Odifreddi","year":"1999","unstructured":"Odifreddi, P.: Classical Recursion Theory, vol. II. Elsevier, Amsterdam (1999)"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Osherson, D., Stob, M., Weinstein, S.: Systems That Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists. Bradford \u2013 The MIT Press, Cambridge (1986)","DOI":"10.7551\/mitpress\/6609.001.0001"},{"key":"12_CR29","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)"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Soare, R.: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Springer, Heidelberg (1987)","DOI":"10.1007\/978-3-662-02460-7"},{"key":"12_CR31","unstructured":"Trakhtenbrot, B.A., B$$\\bar{\\rm a}$$rzdin\u0327s\u0306, J.M.: Konetschnyje awtomaty (powedenie i sinetez). Nauka, Moscow (1970). in Russian. English Translation: Finite Automata-Behavior and Synthesis, Fundamental Studies in Computer Science 1, North-Holland, Amsterdam (1975)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68195-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,22]],"date-time":"2021-02-22T00:13:28Z","timestamp":1613952808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68195-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030681944","9783030681951"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68195-1_12","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":"22 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/irdta.eu\/lata2020&2021\/","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":"52","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":"26","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":"50% - 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":"4","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)"}}]}}