{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:02:16Z","timestamp":1725566536002},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540234104"},{"type":"electronic","value":"9783540301950"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30195-0_31","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T19:53:52Z","timestamp":1285185232000},"page":"288-289","source":"Crossref","is-referenced-by-count":0,"title":["An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries"],"prefix":"10.1007","author":[{"given":"Yasuhiro","family":"Tajima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiyuki","family":"Kotani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matsuaki","family":"Terada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D. Angluin","year":"1981","unstructured":"Angluin, D.: A note on the number of queries needed to identify regular languages. Inf. & Cont.\u00a051, 76\u201387 (1981)","journal-title":"Inf. & Cont."},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular languages from queries and counterexamples. Inf. & Comp.\u00a075, 87\u2013106 (1987)","journal-title":"Inf. & Comp."},{"key":"31_CR3","first-page":"151","volume":"5","author":"H. Ishizaka","year":"1990","unstructured":"Ishizaka, H.: Polynomial time learnability of simple deterministic languages. Machine Learning\u00a05, 151\u2013164 (1990)","journal-title":"Machine Learning"},{"key":"31_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-45257-7_23","volume-title":"Grammatical Inference: Algorithms and Applications","author":"Y. Tajima","year":"2000","unstructured":"Tajima, Y., Tomita, E.: A polynomial time learning algorithm of simple deterministic languages via membership queries and a representative sample. In: Oliveira, A.L. (ed.) ICGI 2000. LNCS (LNAI), vol.\u00a01891, pp. 284\u2013297. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30195-0_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:54:09Z","timestamp":1620014049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30195-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540234104","9783540301950"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30195-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}