{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:36:35Z","timestamp":1725665795129},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_24","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T14:45:36Z","timestamp":1330526736000},"page":"277-288","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial-Time Algorithms for Learning Typed Pattern Languages"],"prefix":"10.1007","author":[{"given":"Michael","family":"Geilke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra","family":"Zilles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci.\u00a021, 46\u201362 (1980)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR2","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. Inform. Control\u00a045, 117\u2013135 (1980)","journal-title":"Inform. Control"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1145\/322326.322334","volume":"29","author":"D. Angluin","year":"1982","unstructured":"Angluin, D.: Inference of reversible languages. J. ACM\u00a029, 741\u2013765 (1982)","journal-title":"J. ACM"},{"key":"24_CR4","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. Inform. Control\u00a028, 125\u2013155 (1975)","journal-title":"Inform. Control"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-04414-4_23","volume-title":"Algorithmic Learning Theory","author":"J. Case","year":"2009","unstructured":"Case, J., K\u00f6tzing, T.: Difficulties in Forcing Fairness of Polynomial Time Inductive Inference. In: Gavald\u00e0, R., Lugosi, G., Zeugmann, T., Zilles, S. (eds.) ALT 2009. LNCS, vol.\u00a05809, pp. 263\u2013277. Springer, Heidelberg (2009)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-24412-4_10","volume-title":"Algorithmic Learning Theory","author":"M. Geilke","year":"2011","unstructured":"Geilke, M., Zilles, S.: Learning Relational Patterns. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol.\u00a06925, pp. 84\u201398. Springer, Heidelberg (2011)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inform. Control\u00a010, 447\u2013474 (1967)","journal-title":"Inform. Control"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"de la Higuera, C.: Characteristic sets for polynominal grammatical inference. In: ICGI, pp. 59\u201371 (1996)","DOI":"10.1007\/BFb0033342"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-59119-2_192","volume-title":"Computational Learning Theory","author":"T. Koshiba","year":"1995","unstructured":"Koshiba, T.: Typed Pattern Languages and Their Learnability. In: Vit\u00e1nyi, P.M.B. (ed.) EuroCOLT 1995. LNCS, vol.\u00a0904, pp. 367\u2013379. Springer, Heidelberg (1995)"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S. Lange","year":"1991","unstructured":"Lange, S., Wiehagen, R.: Polynomial-time inference of arbitrary pattern languages. New Generation Comput.\u00a08, 361\u2013370 (1991)","journal-title":"New Generation Comput."},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-18508-9","volume-title":"Analogical and Inductive Inference","author":"L. Pitt","year":"1987","unstructured":"Pitt, L.: Inductive Inference, DFAs, and Computational Complexity. In: Jantke, K.P. (ed.) AII 1986. LNCS, vol.\u00a0265, pp. 18\u201344. Springer, Heidelberg (1987)"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.tcs.2008.02.029","volume":"397","author":"D. Reidenbach","year":"2008","unstructured":"Reidenbach, D.: Discontinuities in pattern inference. Theor. Comput. Sci.\u00a0397, 166\u2013193 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume-title":"RIMS Symposium on Software Science and Engineering","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Polynomial Time Inference of Extended Regular Pattern Languages. In: Goto, E., Furukawa, K., Nakajima, R., Nakata, I., Yonezawa, A. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Wright, K.: Inductive identification of pattern languages with restricted substitutions. In: COLT, pp. 111\u2013121 (1990)","DOI":"10.1016\/B978-1-55860-146-8.50011-4"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:30:17Z","timestamp":1556440217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}