{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:50:20Z","timestamp":1742971820857,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45583-3_26","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"348-363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Learning Regular Languages Using RFSA"],"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","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J. A. Brzozowski","year":"1964","unstructured":"Janusz A. Brzozowski. Derivatives of regular expressions. Journal of the ACM, 11:481\u2013494, 1964.","journal-title":"Journal of the ACM"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"F. Coste and D. Fredouille. Efficient ambiguity detection in c-nfa. In Grammatical Inference: Algorithms and Applications, volume 1891 of Lecture Notes in Artificial Intelligence. Springer Verlag, 2000.","DOI":"10.1007\/978-3-540-45257-7_3"},{"issue":"7","key":"26_CR3","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1162\/089976698300017197","volume":"10","author":"T. G. Dietterich","year":"1998","unstructured":"Thomas G. Dietterich. Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation, 10(7):1895\u20131923, 1998.","journal-title":"Neural Computation"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using non deterministicfinite automata. In ICGI\u20192000, volume 1891 of Lecture Notes in Artificial Intelligence, pages 39\u201350. Springer Verlag, 2000.","DOI":"10.1007\/978-3-540-45257-7_4"},{"key":"26_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/3-540-44693-1_13","volume-title":"Residual finite state automata","author":"F. Denis","year":"2001","unstructured":"F. Denis, A. Lemay, and A. Terlutte. Residual finite state automata. In 18th Annual Symposium on Theoretical Aspects of Computer Science, volume 2010 of Lecture Notes in Computer Science, pages 144\u2013157, 2001."},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E. M. Gold","year":"1978","unstructured":"E. M. Gold. Complexity of automaton identification from given data. Inform. Control, 37:302\u2013320, 1978.","journal-title":"Inform. Control"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C. Higuera De La","year":"1997","unstructured":"Colin De La Higuera. Characteristic sets for polynomial grammatical inference. Machine Learning, 27:125\u2013137, 1997.","journal-title":"Machine Learning"},{"key":"26_CR8","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"K. J. Lang, B. A. Pearlmutter, and R. A. Price. Results of the Abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In Proc. ICGI\u201998, volume 1433 of Lecture Notes in Artificial Intelligence, pages 1\u201312. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0054059"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"J. Oncina and P. Garcia. Inferring regular languages in polynomial update time. In Pattern Recognition and Image Analysis, pages 49\u201361, 1992.","DOI":"10.1142\/9789812797902_0004"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-59136-5_2","volume":"1","author":"S. Yu","year":"1997","unstructured":"Sheng Yu. Handbook of Formal Languages, Regular Languages, volume 1, chapter 2, pages 41\u2013110. Springer Verlag, 1997.","journal-title":"Handbook of Formal Languages, Regular Languages"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:19:20Z","timestamp":1585603160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}