{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:26:19Z","timestamp":1725474379299},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540452645"},{"type":"electronic","value":"9783540452652"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11872436_30","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:21:00Z","timestamp":1164633660000},"page":"344-345","source":"Crossref","is-referenced-by-count":6,"title":["Learning Finite-State Machines from Inexperienced Teachers"],"prefix":"10.1007","author":[{"given":"Olga","family":"Grinchtein","sequence":"first","affiliation":[]},{"given":"Martin","family":"Leucker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","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. Information and Computation\u00a075, 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"21","author":"A.W. Biermann","year":"1972","unstructured":"Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behaviour. IEEE Transactions on Computers\u00a021, 592\u2013597 (1972)","journal-title":"IEEE Transactions on Computers"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Grinchtein, O., Leucker, M.: Learning finite-state machines from inexperienced teachers. Technical Report TUM-I0613, TU M\u00fcnchen (2006)","DOI":"10.1007\/11872436_30"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Oliveira, A.L., Silva, J.P.M.: Efficient search techniques for the inference of minimum size finite automata. In: String processing and information retrieval (1998)","DOI":"10.1109\/SPIRE.1998.712986"},{"issue":"1\/2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1023\/A:1010828029885","volume":"44","author":"A.L. Oliveira","year":"2001","unstructured":"Oliveira, A.L., Silva, J.P.M.: Efficient algorithms for the inference of minimum size dfas. Machine Learning\u00a044(1\/2), 93\u2013119 (2001)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11872436_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:24:39Z","timestamp":1619508279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11872436_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540452645","9783540452652"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/11872436_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}