{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:49:47Z","timestamp":1725558587842},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_4","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T22:05:01Z","timestamp":1278021901000},"page":"39-50","source":"Crossref","is-referenced-by-count":13,"title":["Learning Regular Languages Using Non Deterministic Finite Automata"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Denis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lien","family":"Lemay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Terlutte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using non deterministic finite automata. Technical Report 7 (2000)","DOI":"10.1007\/978-3-540-45257-7_4"},{"key":"4_CR2","unstructured":"Denis, F., Lemay, A., Terlutt, A.: Les automates finis \u00e0 \u00e9tats r\u00e9siduels (afer). Technical report (2000), ftp:\/\/ftp.grappa.univliller3.fr\/pub\/reports\/after.ps.gz"},{"issue":"2","key":"4_CR3","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. Journal of Computer and System Sciences\u00a052(2), 255\u2013267 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inform. Control\u00a037, 302\u2013320 (1978)","journal-title":"Inform. Control"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. Higuera De La","year":"1997","unstructured":"De La Higuera, C.: Characteristic sets for polynomial grammatical inference. Machine Learning\u00a027, 125\u2013137 (1997)","journal-title":"Machine Learning"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata. Journal of the ACM\u00a041(1), 67\u201395 (1994)","journal-title":"Journal of the ACM"},{"key":"4_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical Inference","author":"K.J. Lang","year":"1998","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingoone DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 1\u201312. Springer, Heidelberg (1998)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. Pattern Recognition and Image Analysis, 49\u201361 (1992)","DOI":"10.1142\/9789812797902_0004"},{"key":"4_CR9","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-51734-0_50","volume-title":"Analogical and Inductive Inference","author":"L. Pitt","year":"1989","unstructured":"Pitt, L.: Inductive Inference, DFAs, and Computational Complexity. In: Jantke, K.P. (ed.) AII 1989. LNCS (LNAI), vol.\u00a0397, pp. 18\u201344. Springer, Heidelberg (1989)"},{"issue":"11","key":"4_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. Commun. ACM\u00a027(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T17:13:22Z","timestamp":1559236402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45257-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410119","9783540452577"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45257-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}