{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:12:46Z","timestamp":1725538366217},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044137"},{"type":"electronic","value":"9783642044144"}],"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_25","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T08:46:05Z","timestamp":1253609165000},"page":"293-307","source":"Crossref","is-referenced-by-count":2,"title":["Uncountable Automatic Classes and Learning"],"prefix":"10.1007","author":[{"given":"Sanjay","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinglong","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Semukhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"25_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(2), 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"25_CR2","unstructured":"B\u00e1r\u00e1ny, V., Kaiser, \u0141., Rubin, S.: Cardinality and counting quantifiers on omega-automatic structures. In: Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008, pp. 385\u2013396 (2008)"},{"key":"25_CR3","first-page":"82","volume":"1","author":"J. B\u0101rzdi\u0146\u0161","year":"1974","unstructured":"B\u0101rzdi\u0146\u0161, J.: Two theorems on the limiting synthesis of functions. Theory of Algorithms and Programs\u00a01, 82\u201388 (1974)","journal-title":"Theory of Algorithms and Programs"},{"key":"25_CR4","first-page":"51","volume-title":"15th Annual IEEE Symposium on Logic in Computer Science","author":"A. Blumensath","year":"2000","unstructured":"Blumensath, A., Gr\u00e4del, E.: Automatic structures. In: 15th Annual IEEE Symposium on Logic in Computer Science, Santa Barbara, CA, pp. 51\u201362. IEEE Computer Society Press, Los Alamitos (2000)"},{"issue":"6","key":"25_CR5","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00224-004-1133-y","volume":"37","author":"A. Blumensath","year":"2004","unstructured":"Blumensath, A., Gr\u00e4del, E.: Finite presentations of infinite structures: automata and interpretations. Theory of Computing Systems\u00a037(6), 641\u2013674 (2004)","journal-title":"Theory of Computing Systems"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. Richard B\u00fcchi","year":"1960","unstructured":"Richard B\u00fcchi, J.: Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"25_CR7","first-page":"1","volume-title":"Logic, Methodology and Philosophy of Science (Proceedings 1960 International Congress)","author":"J. Richard B\u00fcchi","year":"1962","unstructured":"Richard B\u00fcchi, J.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science (Proceedings 1960 International Congress), pp. 1\u201311. Stanford University Press, Stanford (1962)"},{"issue":"6","key":"25_CR8","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 Journal on Computing\u00a028(6), 1941\u20131969 (1999) (electronic)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E. Mark Gold","year":"1967","unstructured":"Mark Gold, E.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"25_CR10","unstructured":"Jain, S., Luo, Q., Stephan, F.: Learnability of automatic classes. Technical Report TRA1\/09, School of Computing, National University of Singapore (2009)"},{"key":"25_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0171-7","volume-title":"Automata theory and its applications","author":"B. Khoussainov","year":"2001","unstructured":"Khoussainov, B., Nerode, A.: Automata theory and its applications. Birkh\u00e4user Boston, Inc., Boston (2001)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-60178-3_93","volume-title":"Logic and Computational Complexity","author":"B. Khoussainov","year":"1995","unstructured":"Khoussainov, B., Nerode, A.: Automatic presentations of structures. In: Leivant, D. (ed.) LCC 1994. LNCS, vol.\u00a0960, pp. 367\u2013392. Springer, Heidelberg (1995)"},{"key":"25_CR13","volume-title":"Systems that learn. An introduction to learning theory for cognitive and computer scientists","author":"D.N. Osherson","year":"1986","unstructured":"Osherson, D.N., Stob, M., Weinstein, S.: Systems that learn. An introduction to learning theory for cognitive and computer scientists. Bradford Book\u2014MIT Press, Cambridge (1986)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-540-70918-3_2","volume-title":"STACS 2007","author":"M..Y. Vardi","year":"2007","unstructured":"Vardi, M.Y.: The B\u00fcchi complementation saga. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 12\u201322. 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_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,19]],"date-time":"2019-01-19T11:47:11Z","timestamp":1547898431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04414-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044137","9783642044144"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04414-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}