{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:44Z","timestamp":1759638344368},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410119"},{"type":"electronic","value":"9783540452577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-540-45257-7_23","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T18:05:01Z","timestamp":1278007501000},"page":"284-297","source":"Crossref","is-referenced-by-count":2,"title":["A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample"],"prefix":"10.1007","author":[{"given":"Yasuhiro","family":"Tajima","sequence":"first","affiliation":[]},{"given":"Etsuji","family":"Tomita","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_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":"23_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. Inf. & Comp.\u00a075, 87\u2013106 (1987)","journal-title":"Inf. & Comp."},{"key":"23_CR3","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"23_CR4","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":"23_CR5","doi-asserted-by":"crossref","unstructured":"Korenjak, A.J., Hopcroft, J.E.: Simple deterministic languages. In: Proc. IEEE 7th Annu. Symp. on Switching and Automata Theory, pp. 36\u201346 (1966)","DOI":"10.1109\/SWAT.1966.22"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Sakamoto, H.: Language learning from membership queries and characteristic examples. In: Proc. 6th Int. Conf. on Algorithmic Learning Theory - ALT 1995. LNCS (LNAI), vol.\u00a0997, pp. 55\u201365 (1995)","DOI":"10.1007\/3-540-60454-5_28"},{"key":"23_CR7","unstructured":"Wakatsuki, M., Tomita, E.: An improved branching algorithm for checking the equivalence of simple DPDA\u2019s and its worst-case time complexity. Trans. of IEICE J74-D-I, 595\u2013603 (1991) (in Japanese)"},{"key":"23_CR8","unstructured":"Yokomori, T.: Learning simple languages in polynomial time. In: Proc. SIG-FAI, JSAI 8801-3, pp. 21\u201330 (1988)"}],"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-45257-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:43:13Z","timestamp":1552624993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45257-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410119","9783540452577"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45257-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}