{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:54Z","timestamp":1759638234031,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_28","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:39:18Z","timestamp":1330288758000},"page":"55-65","source":"Crossref","is-referenced-by-count":6,"title":["Language learning from membership queries and characteristic examples"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Sakamoto","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"4_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Dana Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"4_CR2","unstructured":"Dana Angluin. Learning k-bounded context-free grammars. Technical Report YALEU\/DCS\/RR-557, Department of Computer Science, Yale University, 1987."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87\u2013106, 1987.","journal-title":"Information and Computation"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D. Angluin","year":"1981","unstructured":"Dana Angluin. A note on the number of queries needed to identify regular languages. Information and Control, 51:76\u201387, 1981.","journal-title":"Information and Control"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Piotr Berman and Pobert Roos. Learning one-counter languages in polynomial time. Proceedings of 28th IEEE Symposium on Foundations of Computer Science, pages 61\u201367. IEEE Computer Society Press, 1987.","DOI":"10.1109\/SFCS.1987.36"},{"key":"4_CR6","volume-title":"Introduction to Formal Language Theory","author":"M. A. Harrison","year":"1978","unstructured":"Michael A. Harrison. Introduction to Formal Language Theory. Reading, MA:Addison-Wesley, 1978."},{"key":"4_CR7","first-page":"151","volume":"5","author":"H. Ishizaka","year":"1990","unstructured":"Hiroki Ishizaka. Polynomial time learnability of simple deterministic languages. Machine Learning, 5:151\u2013164, 1990.","journal-title":"Machine Learning"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0019-9958(67)90564-5","volume":"11","author":"D. E. Knuth","year":"1967","unstructured":"Donald E. Knuth. Characterization of Parenthesis Languages. Information and Control, 11:269\u2013289, 1967.","journal-title":"Information and Control"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/321406.321411","volume":"14","author":"R. McNaughton","year":"1967","unstructured":"Robert McNaughton. Parenthesis Grammars. Journal of the ACM, 14:490\u2013500, 1967.","journal-title":"Journal of the ACM"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y. Sakakibara","year":"1990","unstructured":"Yasubumi Sakakibara. Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science, 76:223\u2013242, 1990.","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic program debugging","author":"E. Y. Shapiro","year":"1983","unstructured":"Ehud Y. Shapiro. Algorithmic program debugging. Cambridge, MA: MIT Press, 1983."},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0020-0190(88)90208-6","volume":"28","author":"Y. Takada","year":"1988","unstructured":"Yuji Takada. Grammatical inference for even linear languages based on control sets. Information Processing Letters, 28:193\u2013199, 1988.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:04:13Z","timestamp":1742598253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}