{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:12:07Z","timestamp":1742955127294,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540880080"},{"type":"electronic","value":"9783540880097"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88009-7_15","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"187-199","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with 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"}]}],"member":"297","reference":[{"key":"15_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. Info. & Contl.\u00a051, 76\u201387 (1981)","journal-title":"Info. & Contl."},{"key":"15_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 sets from queries and counterexamples. Info. & Comp.\u00a075, 87\u2013106 (1987)","journal-title":"Info. & Comp."},{"key":"15_CR3","first-page":"473","volume":"5","author":"A. Clark","year":"2004","unstructured":"Clark, A., Thollard, F.: PAC-learnability of probabilistic deterministic finite state automata. J. of Machine Learning Research\u00a05, 473\u2013497 (2004)","journal-title":"J. of Machine Learning Research"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/jcss.1996.0020","volume":"52","author":"S.A. Goldman","year":"1996","unstructured":"Goldman, S.A., Mathias, H.D.: Teaching a smarter learner. J. of Comp. & Sys. Sci.\u00a052, 255\u2013267 (1996)","journal-title":"J. of Comp. & Sys. Sci."},{"key":"15_CR5","volume-title":"Introduction to formal language theory","author":"M.A. Harrison","year":"1978","unstructured":"Harrison, M.A.: Introduction to formal language theory. Addison-Wesley, Reading (1978)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. de la Higuera","year":"1997","unstructured":"de la Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning\u00a027, 125\u2013138 (1997)","journal-title":"Machine Learning"},{"key":"15_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-45435-7_13","volume-title":"Computational Learning Theory","author":"C. de la Higuera","year":"2002","unstructured":"de la Higuera, C., Oncina, J.: Inferring deterministic linear languages. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol.\u00a02375, pp. 185\u2013200. Springer, Heidelberg (2002)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tcs.2004.08.012","volume":"329","author":"Y. Tajima","year":"2004","unstructured":"Tajima, Y., Tomita, E., Wakatsuki, M., Terada, M.: Polynomial time learning of simple deterministic languages via queries and a representative sample. Theor. Comp. Sci.\u00a0329, 203\u2013221 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1006\/inco.1995.1163","volume":"123","author":"Y. Takada","year":"1995","unstructured":"Takada, Y.: A hierarchy of language families learnable by regular language learning. Info. & Comp.\u00a0123, 138\u2013145 (1995)","journal-title":"Info. & Comp."},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Comm. of the ACM\u00a027, 1134\u20131142 (1984)","journal-title":"Comm. of the ACM"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88009-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:47:57Z","timestamp":1715312877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}